Codeforces--1311A--Duff and Weight Lifting

题目描述：
Recently, Duff has been practicing weight lifting. As a hard practice, Malek gave her a task. He gave her a sequence of weights. Weight of i-th of them is 2wi pounds. In each step, Duff can lift some of the remaining weights and throw them away. She does this until there’s no more weight left. Malek asked her to minimize the number of steps.
Duff is a competitive programming fan. That’s why in each step, she can only lift and throw away a sequence of weights 2a1, …, 2ak if and only if there exists a non-negative integer x such that 2a1 + 2a2 + … + 2ak = 2x, i. e. the sum of those numbers is a power of two.

Duff is a competitive programming fan, but not a programmer. That’s why she asked for your help. Help her minimize the number of steps.
输入描述:
The first line of input contains integer n (1 ≤ n ≤ $10^6$), the number of weights.

The second line contains n integers w1, …, wn separated by spaces (0 ≤ wi ≤ $10^6$ for each 1 ≤ i ≤ n), the powers of two forming the weights values.
输出描述:
Print the minimum number of steps in a single line.
输入：
5
1 1 2 3 3
4
0 1 2 3
输出：
2
4
Note
In the first sample case: One optimal way would be to throw away the first three in the first step and the rest in the second step. Also, it’s not possible to do it in one step because their sum is not a power of two.
In the second sample case: The only optimal way is to throw away one weight in each step. It’s not possible to do it in less than 4 steps because there’s no subset of weights with more than one weight and sum equal to a power of two.
题意：
两个1合成一个2，两个2合成一个3，两个3合成一个4，以此类推，问最后剩下数的个数
题解：
统计各个数的个数，按两个1合成一个2的思路，直接暴力枚举，时间复杂度O（n），水题。
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

const int maxn = 2000000 + 5;
int a[maxn],x;

int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        memset(a,0,sizeof(a));
        for(int i = 0; i < n; i ++){
            scanf("%d",&x);
            a[x] ++;
        }
        int ans = 0;
        for(int i = 0; i <= 2000000; i ++){
            a[i + 1] += a[i] / 2;
            if(a[i] % 2) ans ++;
        }
        cout<<ans<<endl;
    }
    return 0;
}