CF-379C
2013-12-31 19:11
337 查看
题意:在给定的序列中使得原来有相同的元素调整为全不相同,并且使得改变的序列和最少,还要满足每个人的要求。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std ;
struct node{
__int64 num;
int id;
}a[300005];
__int64 b[300005];
bool cmp(node a,node b)
{
if(a.num==b.num) return a.id<b.id;
return a.num<b.num;
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF){
for(int i=0;i<n;i++){
scanf("%I64d",&a[i].num);
a[i].id=i;
}
sort(a,a+n,cmp);
b[a[0].id]=a[0].num;
for(int i=1;i<n;i++){
if(a[i].num<=b[a[i-1].id]){
b[a[i].id]=b[a[i-1].id]+1;
}
else b[a[i].id]=a[i].num;
}
for(int i=0;i<n;i++) printf(i==0?"%I64d":" %I64d",b[i]);
puts("");
}
return 0 ;
}
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std ;
struct node{
__int64 num;
int id;
}a[300005];
__int64 b[300005];
bool cmp(node a,node b)
{
if(a.num==b.num) return a.id<b.id;
return a.num<b.num;
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF){
for(int i=0;i<n;i++){
scanf("%I64d",&a[i].num);
a[i].id=i;
}
sort(a,a+n,cmp);
b[a[0].id]=a[0].num;
for(int i=1;i<n;i++){
if(a[i].num<=b[a[i-1].id]){
b[a[i].id]=b[a[i-1].id]+1;
}
else b[a[i].id]=a[i].num;
}
for(int i=0;i<n;i++) printf(i==0?"%I64d":" %I64d",b[i]);
puts("");
}
return 0 ;
}
相关文章推荐
- cf-379C
- CF~Good Bye 2014 C. New Year Book Reading
- cf 334A
- CF 287 div2 A
- CF 286(div 2) B Mr. Kitayuta's Colorful Graph【传递闭包】
- cf 505d Mr. Kitayuta's Technology
- CF 510B(Fox And Two Dots-图上找环)
- CF_505C Mr. Kitayuta, the Treasure Hunter
- win7系统CF截图后找不到怎么办?
- CF 457A(Golden System-特殊的进制)
- cf 11A Increasing Sequence(水,)
- CF327D (dfs)
- CF 527B 思维题
- cf_297
- CF 525B Pasha and String
- CodeForces--ZeptoLab Code Rush 2015 (我参加的第一场cf比赛)
- [CF 251E]Tree and Table题解翻译
- CF 500G
- CF Fox And Two Dots (DFS)
- cf 301 div2