codeforces 305 C. Ivan and Powers of Two
来源:互联网 发布:鹊桥淘宝客是什么 编辑:程序博客网 时间:2024/06/06 09:33
题目链接
给出一个非减序的数组a[n], 然后得到s=2^a1+.……+2^an, 要使s为2^v -1,需要在数组中添加几个数。
我的思路是这样的,由2^a+2^a = 2^(a+1)可知,如果有两个连续的数a,我们可以把他们合并为a+1放入集合中,使集合中没有重复的数,我可以用stl里的set。如果想要满足题目中的要求,集合中必须有最大那个数个元素,缺多少就可以计算出来了。
代码:
//codeforces 305 C. Ivan and Powers of Two//2013-06-05-17.19#include <stdio.h>#include <set>#include <algorithm>#include <iostream>using namespace std;set<int> s;int main(){ int n, a; while (scanf("%d", &n) != EOF) { s.clear(); int maxn = 0; for (int i = 1; i <= n; i++) { scanf("%d", &a); while (s.count(a)) { s.erase(a); a++; } s.insert(a); maxn = max(a, maxn); } printf("%d\n", maxn-s.size()+1); } return 0;}
- codeforces 305 C. Ivan and Powers of Two
- CodeForces 305C--Ivan and Powers of Two (STL:set)
- Ivan and Powers of Two
- Ivan and Powers of Two
- Ivan and Powers of Two
- Ivan and Powers of Two
- CF_305_C. Ivan and Powers of Two
- CodeForces 305CIvan and Powers of Two【set】
- Codeforces 702B - Powers of Two
- codeforces-702B-Powers of Two
- CodeForces 702B Powers of Two
- Codeforces 702B. Powers of Two
- codeforces 702B - Powers of Two
- Libgdx powers of two
- CodeForces702B Powers of Two
- codeforces-Powers of Two(map的应用)
- Educational Codeforces Round 15 B. Powers of Two
- Codeforces 702 B. Powers of Two(二分)
- MVC Model中直接生成匿名新类
- 130604RAC打补丁-成功从10.2.0.1升级到10.2.0.4
- 调用Android中的软键盘
- DBGrid支持鼠标滚轮滚动的解决办法
- 信息: validateJarFile(D:\tomcat\Tomcat 5.5\webapps\CH_9\WEB-INF\lib\javax.servlet.jar) - jar not loade
- codeforces 305 C. Ivan and Powers of Two
- Android 对话框(Dialog)大全 建立你自己的对话框
- Oracle外部表详解
- 理解group by(小示例)
- 多层view触摸传递分析
- 设置Samba服务器中新建文件/目录的权限
- org.apache.jasper.JasperException: java.lang.NullPointerException
- php 中require() include() require_once()
- gvim 备份文件去除 配置