Contest 4

　　A：cf原题。当然是不是也没什么关系。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int read()
{
    int x=,f=;char c=getchar();
    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}
    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();
    return x*f;
}
#define N 1000010
int n,a[N];
int main()
{
    freopen("sequence.in","r",stdin);
    freopen("sequence.out","w",stdout);
    n=read();
    for (int i=;i<=n;i++) a[i]=read();
    sort(a+,a+n+);
    cout<<a[n]-a[]-n+;
    return ;
}

　　B：非常裸的矩乘。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int read()
{
    int x=,f=;char c=getchar();
    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}
    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();
    return x*f;
}
#define P 1000000007
#define N 9
int T,n;
struct matrix
{
    int n,a[N][N];
    matrix operator *(matrix b) const
    {
        matrix c;c.n=n;memset(c.a,,sizeof(c.a));
        for (int i=;i<n;i++)
            for (int j=;j<N;j++)
                for (int k=;k<N;k++)
                c.a[i][j]=(c.a[i][j]+1ll*a[i][k]*b.a[k][j]%P)%P;
        return c;
    }
}f,a,b;
int trans(int x,int y){return x*+y;}
int main()
{
    freopen("food.in","r",stdin);
    freopen("food.out","w",stdout);
    T=read();
    a.n=N;f.n=;
    for (int i=;i<;i++)
        for (int j=;j<;j++)
            for (int k=;k<;k++)
            if (!(i==j&&j==k)&&!(j==&&i+k==)&&!((j==||j==)&&(i==&&k==))) a.a[trans(i,j)][trans(j,k)]=;
    b=a;
    while (T--)
    {
        n=read()-;
        if (n<) {printf("3\n");continue;}
        a=b;
        for (int i=;i<;i++) f.a[][i]=;
        for (;n;n>>=,a=a*a) if (n&) f=f*a;
        int ans=;
        for (int i=;i<;i++) ans=(ans+f.a[][i])%P;
        printf("%d\n",ans);
    }
    return ;
}

　　C：非常显然的堆。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
int read()
{
    int x=,f=;char c=getchar();
    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}
    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();
    return x*f;
}
#define N 100010
#define ll long long
int n,a[N],b[N],cnt;
ll delta;
priority_queue<ll,vector<ll>,greater<ll> >q;
int main()
{
    freopen("snow.in","r",stdin);
    freopen("snow.out","w",stdout);
    n=read();
    for (int i=;i<=n;i++) a[i]=read();
    for (int i=;i<=n;i++) b[i]=read();
    for (int i=;i<=n;i++)
    {
        q.push(a[i]+delta);cnt++;
        ll ans=;
        while (!q.empty()&&q.top()<=delta+b[i]) ans+=q.top()-delta,q.pop(),cnt--;
        delta+=b[i];
        printf("%I64d ",ans+1ll*cnt*b[i]);
    }
    return ;
}

　　result：300 rank1