cf#AIM Tech Round -B. Making a String-贪心/set
2016-02-05 23:07
495 查看
n个字母,每个最多出现A[I]次,每个字母出现次数必须是唯一的,问这个字符串最长多长
set判重。排个序,显然从最大的开始选,如果不能选,则减减后再判断,直到为零
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <iostream>
using namespace std;
#define ptf(ar1,ar2) pr__int64f("%I64d:%I64d\n",ar1,ar2);
typedef __int64 ll;
const ll maxn = 131707+500;
__int64 tm[56];
int main()
{
int i,n;
cin>>n;
for (i=1;i<=n;i++)
scanf("%I64d",&tm[i]);
sort(tm+1,tm+1+n);
set<__int64 > sb;
__int64 sum=0;
for (i=n;i>=1;i--)
{
__int64 tmp=tm[i];
while(tmp&&sb.find(tmp)!=sb.end())
tmp--;
if (tmp<=0) continue;
if (sb.find(tmp)==sb.end())
{
sum+=tmp;
sb.insert(tmp);
}
}
printf("%I64d\n",sum );
}
set判重。排个序,显然从最大的开始选,如果不能选,则减减后再判断,直到为零
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <iostream>
using namespace std;
#define ptf(ar1,ar2) pr__int64f("%I64d:%I64d\n",ar1,ar2);
typedef __int64 ll;
const ll maxn = 131707+500;
__int64 tm[56];
int main()
{
int i,n;
cin>>n;
for (i=1;i<=n;i++)
scanf("%I64d",&tm[i]);
sort(tm+1,tm+1+n);
set<__int64 > sb;
__int64 sum=0;
for (i=n;i>=1;i--)
{
__int64 tmp=tm[i];
while(tmp&&sb.find(tmp)!=sb.end())
tmp--;
if (tmp<=0) continue;
if (sb.find(tmp)==sb.end())
{
sum+=tmp;
sb.insert(tmp);
}
}
printf("%I64d\n",sum );
}
相关文章推荐
- cf#AIM Tech Round -C. Graph and String-贪心/ 二分图染色
- cf#AIM Tech D. Array GCD (数学+枚举)
- AIM Tech Round (Div. 2) D. Array GCD(dp)
- codeforces AIM Tech Round
- WM_PAINT消息详解,使用InvalidateRect或InvalidateRgn函数刻意产生WM_PAINT消息(WIN7里有变化,“调整视觉效果”,将“启用桌面组合”去掉)
- WM_PAINT消息在窗口重绘的时候产生,那什么时候窗口会重绘(异步工作方式,效率更高,灵活性更强)
- 四川成都电信天邑TEWA-300AI EPON光猫各种折腾
- Cloud Foundry warden container 安全性探讨
- async await
- VIM配置:vim-airline插件安装
- AIM Tech Round (Div. 2) C. Graph and String
- AIM Tech Round (Div. 2)C - Graph and String(二分图染色)
- gmail如何设置邮箱别名
- Codeforces AIM Tech Round (Div. 1) ABD
- Codeforces AIM Tech Round (Div. 1) A Graph and String 想法
- AIM Tech Round (Div. 2) D. Array GCD dp
- poj 3007 Organize Your Train part II(字符串哈希)
- symfony2 服务容器(Service Container)
- AIM Tech Round (Div. 2) C. Graph and String 二分图染色
- AIM Tech Round (Div. 2) B. Making a String 贪心