原题链接:https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1596
思路:二进制进位啦,只要一个位上的个数大于等于2就可以向上进步,如果为1,ans++
AC代码:
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1000055;
const int INF = 0x3f3f3f3f;
int n, t, cnt[MAXN], mm;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &t);
cnt[t]++;
mm = max(mm, t);
}
int ans = 0, i = 0;
while (true) {
if (i > mm && cnt[i] == 0)break;
if (cnt[i] >= 2) {
cnt[i + 1] += cnt[i] / 2;
cnt[i] -= cnt[i] / 2 * 2;
}
if (cnt[i] == 1)ans++;
i++;
}
printf("%d\n", ans);
return 0;
}