Codeforces Round #326 (Div. 1)A. Duff and Weight Lifting
来源:互联网 发布:啊哈算法 在线阅读 编辑:程序博客网 时间:2024/05/22 00:47
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 ≤ 106), the number of weights.
The second line contains n integers w1, ..., wn separated by spaces (0 ≤ wi ≤ 106 for each 1 ≤ i ≤ n), the powers of two forming the weights values.
Print the minimum number of steps in a single line.
51 1 2 3 3
2
40 1 2 3
4
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.
题意:
达夫每天练习举重,教练给了她n个重量值为2^wi哑铃让她举,每次达夫可以举起满足2^a1+2^a2+…+2^ak=2^x的重量并将这些哑铃扔掉,问达夫最少几次完成教练的任务
思路:
用数组记录2^n的个数,然后求a[n]=a[n-1]/2+a[n],当a[n]%2==1时记录一次(为举不了的部分)
#include <iostream>#include <cstring>#include <cstdio>using namespace std;const int max_i=10000010;int a[max_i];int main(){ memset(a,0,sizeof(a)); int t; scanf("%d",&t); for(int i=1;i<=t;i++) { int temp; scanf("%d",&temp); a[temp]++; } int ans=a[0]%2; for(int i=1;i<max_i;i++) { a[i]=a[i-1]/2+a[i]; if(a[i]%2==1) ans++; } printf("%d\n",ans); return 0;}
- Codeforces Round #326 (Div. 1)A. Duff and Weight Lifting
- Codeforces Round #326 (Div. 1)-A. Duff and Weight Lifting
- Codeforces Round #326 (Div. 2)587A. Duff and Weight Lifting
- Codeforces Round #326 (Div. 2)Problem C - Duff and Weight Lifting
- codeforces-587A-Duff and Weight Lifting
- A. Duff and Weight Lifting
- 【Codeforces Round 326 (Div 2)C】【贪心】Duff and Weight Lifting 每次取数二的幂数最小取数次数
- codeblocks round 326 div2 C Duff and Weight Lifting
- codeforces#326-C-Duff and Weight Lifting-map应用
- 【1】【数学】CodeForces 588C Duff and Weight Lifting
- Codeforces 588 C. Duff and Weight Lifting
- CodeForces 588 C. Duff and Weight Lifting
- coderforce 587A Duff and Weight Lifting
- Codeforces Round #326 (Div. 2) A. Duff and Meat
- Codeforces Round #326 (Div. 2) 588 A. Duff and Meat
- Codeforces Round #326 (Div. 2) A. Duff and Meat
- Codeforces Round #326 (Div. 2) A. Duff and Meat
- Codeforces 588C Duff and Weight Lifting 【数学】
- 集合类的简介
- PopupWindow设置其他Activity变暗的效果
- 输出响应的数据给客户端并结束请求,继续执行后面的代码
- Leetcode - 14. Longest Common Prefix
- 第七届河南省程序设计大赛
- Codeforces Round #326 (Div. 1)A. Duff and Weight Lifting
- Java千百问_03基础语法(012)_transient关键字有什么用
- redis事件
- VideoView播放视频异常MediaPlayer: Error (1,-2147483648)
- Python学习 (九 正则表达式)
- UIResponder
- Zookeeper的安装配置及基本开发
- UVA 11752 The Super Powers(至少是两个正整数的幂的幂数)
- 构造方法