https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1596
思路是很好想的,关键是被输入卡住。
还以为O(N)的都不行呢。。
模拟二进制,合并一次,那么那个数就可以和别人一起放,那么就可以减去一次。就酱
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e7+200;
template <class T>
inline void scan_d(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 a[maxn];
int main()
{ int a1,m;
while(~scanf("%d",&m)){
memset(a,0,sizeof(a));
int sum=m;
int min1=1e7;
int max1=-1;
for(int i=0;i<m;i++){
scan_d(a1);
//./min1=min(min1,a1);
//max1=max(max1,a1);
a[a1]++;
while(a[a1]>1){
a[a1+1]++;
a[a1]-=2;
sum--;
}
}
for(int i=0;i<maxn;i++){
if(a[i]==0||a[i]==1)continue;
while(a[i]>1){
sum--;
a[i]-=2;
a[i+1]++;
}
}
printf("%d\n",sum);
}
return 0;
}