Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)D. Generating Sets(贪心)
来源:互联网 发布:淘宝助理安装数字证书 编辑:程序博客网 时间:2024/05/21 06:35
题意
给出一个数x以及变换,可以变成2x,或者变成2x+1,或者不变,变化可以操作若干次
现在给你n个不同的数Y,你需要找到n个不同的x,使得这n个不同的x经过变化之后,能够得到Y数组,并使得X中数的最大值最小。问你应该怎么做。
题解:
每次取最大的数,然后使最大数变小即可,能变就变,用一个set去维护就好了。
#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<vector>#include<set>using namespace std;struct cmp{bool operator()(int x,int y){return x>y;}};int main(){int n;set<int,cmp> cnt;scanf("%d",&n);for(int i=1;i<=n;i++){int p;scanf("%d",&p);cnt.insert(p);} while(1){int p=*cnt.begin();while(p){p/=2;if(cnt.find(p)==cnt.end()&&p!=0){cnt.erase(cnt.begin());cnt.insert(p);break;}}if(p==0) break;}for(int i=1;i<=n;i++){printf("%d ",*cnt.begin());cnt.erase(cnt.begin());}return 0;}
0 0
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) -- D. Generating Sets(贪心)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)D. Generating Sets(贪心)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) D. Generating Sets 贪心
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) D. Generating Sets __ dfs+优先队列+贪心
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) -- A. Broken Clock (贪心)
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) [D] Destroying Array
- 【Intel Code Challenge Elimination Round (Div1 + Div2, combined) D】【贪心 暴力 SET】Generating Sets n个不同的x变
- Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) D. Dense Subsequence 贪心 + RMQ
- Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) D. Dense Subsequence ST表+贪心
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) -- B. Verse Pattern(水题)
- Codeforces Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) 部分题解
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) C 并查集
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) E
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) F
- codeforeces722 Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)
- Java事务(七) - 分布式事务 - spring + JTA + jotm
- Visual C++ 之 动态链接库
- Java事务(八) - 分布式事务 - spring + JTA + atomikos
- 杭电ACM2001题------java语言
- CSS实现猎豹浏览器首页标签切换效果
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)D. Generating Sets(贪心)
- Linux下安装Git
- 八皇后问题(递归)
- C# 创建和写入文件
- Penetration testing checklist based on OWASP Top 10 Mobile
- 链表反转算法
- eclipse查看jar包源代码乱码问题解决
- 大数据系列修炼-Scala课程68
- C++学习笔记--对象创建