51Nod 1596 搬货物

http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1596

 

思路：

模拟二进制的进位。

这题很坑啊...用c++会超时，用c就行了...

#include<stdio.h>
#include<string.h>

const int maxn=1e6+1000;

int w[maxn];

int main()
{
    //freopen("D:\\input.txt","r",stdin);
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        memset(w,0,sizeof(w));
        int x;
        while(n--)
        {
            scanf("%d",&x);
            w[x]++;        }
        int sum=0;
        for(int i=0;i<maxn;i++)
        {
            if(w[i]>1)
            {
                w[i+1]+=w[i]/2;
                w[i]%=2;
            }
            if(w[i]==1)  sum++;
        }
        printf("%d\n",sum);
    }
    return 0;
}