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 ≤ 10610^6106), the number of weights.

The second line contains n integers w1, …, wn separated by spaces (0 ≤ wi ≤ 10610^6106 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;
}

Codeforces--1311A--Duff and Weight Lifting相关推荐

Codeforces Round #326 (Div. 2) B. Pasha and Phone C. Duff and Weight Lifting
B. Pasha and Phone Pasha has recently bought a new phone jPager and started adding his friends' phon ...
Codeforces Round #326 (Div. 2) B. Pasha and Phone C. Duff and Weight Lifting
B. Pasha and Phone Pasha has recently bought a new phone jPager and started adding his friends' phon ...
【CodeForces - 298D】Fish Weight （OAE思想，思维）
题干: It is known that there are k fish species in the polar ocean, numbered from 1 to k. They are sor ...
Codeforces 827D Best Edge Weight 倍增 + 并查集 || 倍增 + 压倍增标记（看题解）
Best Edge Weight 我们先找出一棵最小生成树, 对于非树边来说, 答案就是两点路径上的最大值 - 1, 这个直接倍增就能处理. 对于树边来说, 就是非树边的路径经过这条边的最小值 - 1 ...
SCAU-春季训练-不应该啊（怎么这么菜。。。）
2021/3/14 春季训练2(难度div2d) 反思:(赛前,看什么crt,赛时满脑子都是线性方程组,....................................) 最近表现都不太好.. ...
material-ui_满足Material-UI —您最喜欢的新用户界面库
material-ui by Code Realm 通过Code Realm 满足Material-UI -您最喜欢的新用户界面库 (Meet Material-UI - your new favor ...
keras 香草编码器_完善纯香草javascript中的拖放
keras 香草编码器 Drag-and-drop functionality is the bread and butter of a modern web UX. It's an aspect o ...
编写代码的软件用什么编写的_如何通过像编写代码一样克服对编写的恐惧
编写代码的软件用什么编写的 by Chris Rowe 通过克里斯·罗 How often do you get the fear? What do I mean by fear? How about ...
PhoneGap插件入门（转）
PhoneGap插件概述 PhoneGap有两部分组成 1.PhoneGap javascript API,即对在浏览器(支持各种浏览器)上运行的javascript公开的一些原始功能的API 2. ...
我的AI之路(55)--如何获取kinetics数据集和如何制作自己的kinetics数据集
近来做行为动作识别,根据近两年的CVPR.ICCV.ECCV论文实验了一序列的动作识别方面的模型,很多都用到了kinetics数据集或者something-something数据集,但是后者的官网目前 ...

Codeforces--1311A--Duff and Weight Lifting

Codeforces--1311A--Duff and Weight Lifting相关推荐

最新文章

热门文章