51nod 1596 搬货物

题目链接：https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1596
思路：
2^2+2^2=2^3
2^2+2^2+2^2+2^2=2*(2^3)
2^3+2^3=2^4
可以一直往上“合并”。单出来的就拿出来。

#include<cstdio>#include<queue>#include<iostream>#include<vector>#include<map>#include<cstring>#include<string>#include<set>#include<stack>#include<algorithm>#define cle(a) memset(a,0,sizeof(a))#define inf(a) memset(a,ox3f,sizeof(a))#define ll long long#define Rep(i,a,n) for(int i=a;i<=n;i++)using namespace std;const int INF = ( 2e9 ) + 2;const int maxn = 1e6+100;int a[maxn];template <class T>inline void scand(T &ret){    char c;    ret = 0;    while ((c = getchar()) < '0' || c > '9');    while (c >= '0' && c <= '9')    {        ret = ret * 10 + (c - '0'), c = getchar();    }}int main(){    int n;    scanf("%d",&n);    int mx=-1;    for(int i=0;i<n;i++)    {        int t;        scand(t);        a[t]++;        if(mx<t)mx=t;    }    int ans=0;    for(int i=0;i<=mx+99;i++)    {        if(a[i])        {            a[i+1]+=a[i]/2;            ans+=a[i]%2;        }    }    printf("%d\n",ans);}