#include<iostream>

#include<cstdio>

#include<algorithm>

using namespace std;

int n,a[],cnt;

int main(){

    freopen("multiset.in","r",stdin);freopen("multiset.out","w",stdout);

//    freopen("Cola.txt","r",stdin);

    scanf("%d",&n);

    for(int i=;i<=n;i++)scanf("%d",&a[i]);

    if(n==&&a[]==){

        puts("");

        return ;

    }

    int ans=;

    sort(a+,a+n+);

    int q=;

    for(int i=;i<=n;i++){

        if(a[i]!=){q=i;break;}

        cnt++;

    }

    while(){

        if(q>n)break;

        ans++;cnt=cnt/+cnt%;

        for(int i=q;i<=n;i++)a[i]-=;

//        for(int i=1;i<=n;i++)cout<<a[i]<<' ';

        while(a[q]==&&q<=n)cnt++,q++;

    }

    while(cnt>){

        ans++;

        cnt=cnt/+cnt%;

    }

    printf("%d",ans);

}

#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#define maxn 1000010

using namespace std;

int n,a[maxn],cnt[maxn],res,lim;

int main(){

    freopen("multiset.in","r",stdin);

    freopen("multiset.out","w",stdout);

    scanf("%d",&n);

    for(int i=;i<=n;i++){

        scanf("%d",&a[i]);

        lim=max(lim,a[i]);

        cnt[a[i]]++;

    }

    int l=,z=cnt[];

    for(int i=;i<=lim;i++){

        res++;

        z=(z+)/;

        z+=cnt[i];

    }

    for(;z>;z=(z+)/)res++;

    printf("%d",res);

    return ;

}

#include<iostream>

#include<cstdio>

#include<vector>

#include<cstring>

#include<algorithm>

#define maxn 100010

#define maxm 500010

using namespace std;

int n,m,num,head[maxn],mid;

int q[maxm],q1[maxm],cnt;

vector<int>road[];

struct node{

    int to,pre,id;

}e[maxm];

struct Node{

    int l,r;

}jian[maxm];

void Insert(int from,int to){

    e[++num].to=to;

    e[num].id=num;

    e[num].pre=head[from];

    head[from]=num;

}

bool vis[maxm];

void dfs(int pos,int c){

    if(pos==n){

        cnt++;

        jian[cnt].l=0x7fffffff;

        for(int i=;i<c;i++){

            road[cnt].push_back(q[i]);

            jian[cnt].l=min(jian[cnt].l,q[i]);

            jian[cnt].r=max(jian[cnt].r,q[i]);

        }

        return;

    }

    for(int i=head[pos];i;i=e[i].pre){

        int to=e[i].to;

        if(!vis[to]){

            q[c]=i;

            vis[to]=;

            dfs(to,c+);

            vis[to]=;

        }

    }

}

bool cmp(Node x,Node y){return x.l<y.l;}

int main(){

    freopen("road.in","r",stdin);freopen("road.out","w",stdout);

//    freopen("Cola.txt","r",stdin);

    scanf("%d%d",&n,&m);

    int x,y;

    for(int i=;i<=m;i++){

        scanf("%d%d",&x,&y);

        Insert(x,y);

    }

    vis[]=;

    dfs(,);

    memset(vis,,sizeof(vis));

    sort(jian+,jian+cnt+,cmp);

    int ans=;

    int L=,R=0x7fffffff;

    int last=;

    for(int i=;i<=cnt;i++){

        L=max(L,jian[i].l);

        R=min(R,jian[i].r);

        if(L>=R){

//            if(!flag)flag=1,ans+=2;

//            else ans+=1;

            ans+=;

            L=;R=0x7fffffff;

            last=i;

        }

    }

    if(last!=cnt)ans++;

    printf("%d",ans);

    return ;

}

#include<iostream>

#include<cstdio>

#include<cstdlib>

#include<algorithm>

#include<vector>

#define maxn 500010

using namespace std;

int n,m,vis[maxn],x[maxn],y[maxn];

vector<int>vec[maxn];

bool dfs(int u){

    if(vis[u])return false;

    if(u==n)return true;

    vis[u]=;

    bool ret=false;

    for(int i=;i<vec[u].size();i++){

        ret=dfs(vec[u][i]);

        if(ret)return true;

    }

    return false;

}

bool check(int sta,int las){//检验sta~las的边能（0）否（1）在同一组内

    for(int i=sta;i<=las;i++)

        vec[x[i]].push_back(y[i]);

    bool ret=dfs();

    for(int i=sta;i<=las;i++){

        vis[x[i]]=vis[y[i]]=;

        vec[x[i]].clear();

    }

    vis[]=;

    return ret;

}

int main(){

    freopen("road.in","r",stdin);freopen("road.out","w",stdout);

    scanf("%d%d",&n,&m);

    for(int i=;i<m;i++)scanf("%d%d",&x[i],&y[i]);

    int now=,ans=;

    while(now<m){

        int i;

        for(i=;i+now<=m;i<<=)

            if(check(now,now+i-))break;

        i>>=;

        int nowtmp=now+i;

        for(;i>;i>>=)

            if(nowtmp+i<=m&&!check(now,nowtmp+i-))

                nowtmp+=i;

        ans++;now=nowtmp;

    }

    cout<<ans;

}

#include<iostream>

#include<cstdio>

#include<algorithm>

#define maxn 1010

using namespace std;

int T,n,a[maxn];

int main(){

    freopen("cs.in","r",stdin);freopen("cs.out","w",stdout);

//    freopen("Cola.txt","r",stdin);

    scanf("%d",&T);

    while(T--){

        scanf("%d",&n);

        for(int i=;i<=n;i++)scanf("%d",&a[i]);

        sort(a+,a+n+);

        int p=,ans=;

        while(){

            if(a[p]==&&p!=n){

                a[p+]-=;

                a[p]-=;

                for(int i=p+;i<=n;i++)a[i]-=;

                sort(a+,a+n+);

            }

            else{

                a[p]-=;

                if(a[p]==-)ans++;

                for(int i=p+;i<=n;i++)a[i]-=;

            }

            while(a[p]<=)p+=;

            if(p>n)break;

        }

        printf("%d\n",ans);

    }

}

#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#define maxn 1010

using namespace std;

int a[maxn],cnt[maxn],sta[maxn],c[maxn],f[maxn][maxn];

int main(){

    freopen("cs.in","r",stdin);freopen("cs.out","w",stdout);

    int T;

    scanf("%d",&T);

    while(T--){

        int n,mxn=;

        scanf("%d",&n);

        memset(cnt,,sizeof(cnt));

        memset(c,,sizeof(c));

        memset(f,,sizeof(f));

        for(int i=;i<=n;i++){

            scanf("%d",&a[i]);

            ++cnt[a[i]];

            mxn=max(mxn,a[i]);

        }

        int top=;

        for(int i=;i<=mxn;i++)

            if(cnt[i]==)sta[++top]=i;

            else{

                while(cnt[i]>&&top>){

                    c[sta[top--]]=i;

                    --cnt[i];

                }

                c[i]=i;

            }

        int ans=;

        for(int i=;i<=mxn;i++){

            for(int j=;j<=i;j++){

                if(j>)f[i][j]=f[i-][j-];

                if(c[i]!=&&j+c[i]-i<i)

                    f[i][j]=max(f[i][j],f[i-][j+c[i]-i]+);

                ans=max(ans,f[i][j]);

            }

        }

        printf("%d\n",ans);

    }

    return ;

}

预计得分0++玄学

实际得分50++

今天上午的题风格很奇怪，感觉暴力很难打，T1一开始没有思路，后来瞎几把乱打得了50。T2写了非常裸的暴力，T3没有思路，就贪心写了写。

这套题比较锻炼暴力能力，对思维的挑战也比较大，但是T2暴力得的分有点少，改题的时候要看看暴力怎么优化