CodeForces 546B C(Contest #1)
2015-07-19 21:24
267 查看
DescriptionColonel has n badges. He wants to give one badge to every of his n soldiers. Each badge has a coolness factor, which shows how much it's owner reached. Coolness factor can be increased by one for the cost of one coin.For every pair of soldiers one of them should get a badge with strictly higher factor than the second one. Exact values of their factors aren't important, they just need to have distinct factors.Colonel knows, which soldier is supposed to get which badge initially, but there is a problem. Some of badges may have the same factor of coolness. Help him and calculate how much money has to be paid for making all badges have different factors of coolness.InputFirst line of input consists of one integer n (1 ≤ n ≤ 3000).Next line consists of n integers ai (1 ≤ ai ≤ n), which stand for coolness factor of each badge.OutputOutput single integer — minimum amount of coins the colonel has to pay.Sample InputInput
#include <map>
#include <set>
#include <vector>
#include <math.h>
#include <bitset>
#include <list>
#include <algorithm>
#include <climits>
using namespace std;#define lson 2*i
#define rson 2*i+1
#define LS l,mid,lson
#define RS mid+1,r,rson
#define UP(i,x,y) for(i=x;i<=y;i++)
#define DOWN(i,x,y) for(i=x;i>=y;i--)
#define MEM(a,x) memset(a,x,sizeof(a))
#define W(a) while(a)
#define gcd(a,b) __gcd(a,b)
#define LL long long
#define N 5000005
#define INF 0x3f3f3f3f
#define EXP 1e-8
#define lowbit(x) (x&-x)
const int mod = 1e9+7;
#define LL __int64
int n,a[3005];
int main()
{
int i,j,ans;
while(~scanf("%d",&n))
{
ans = 0;
int sum1 = 0,sum2 = 0;
for(i = 1; i<=n; i++)
{
scanf("%d",&a[i]);
sum1+=a[i];
}
sort(a+1,a+1+n);
sum2 = a[1];
for(i = 2; i<=n; i++)
{
if(a[i] == a[i-1])
a[i]++;
else if(a[i]<a[i-1])
a[i] +=(a[i-1]-a[i])+1;
sum2+=a[i];
}
printf("%d\n",sum2-sum1);
}return 0;
}
4 1 3 1 4Output
1Input
5 1 2 3 2 5Output
2
#include <map>
#include <set>
#include <vector>
#include <math.h>
#include <bitset>
#include <list>
#include <algorithm>
#include <climits>
using namespace std;#define lson 2*i
#define rson 2*i+1
#define LS l,mid,lson
#define RS mid+1,r,rson
#define UP(i,x,y) for(i=x;i<=y;i++)
#define DOWN(i,x,y) for(i=x;i>=y;i--)
#define MEM(a,x) memset(a,x,sizeof(a))
#define W(a) while(a)
#define gcd(a,b) __gcd(a,b)
#define LL long long
#define N 5000005
#define INF 0x3f3f3f3f
#define EXP 1e-8
#define lowbit(x) (x&-x)
const int mod = 1e9+7;
#define LL __int64
int n,a[3005];
int main()
{
int i,j,ans;
while(~scanf("%d",&n))
{
ans = 0;
int sum1 = 0,sum2 = 0;
for(i = 1; i<=n; i++)
{
scanf("%d",&a[i]);
sum1+=a[i];
}
sort(a+1,a+1+n);
sum2 = a[1];
for(i = 2; i<=n; i++)
{
if(a[i] == a[i-1])
a[i]++;
else if(a[i]<a[i-1])
a[i] +=(a[i-1]-a[i])+1;
sum2+=a[i];
}
printf("%d\n",sum2-sum1);
}return 0;
}
相关文章推荐
- Borrowers
- LintCode: isSubTree
- php笔记03:布尔类型,字符串,浮点数
- 【leetcode】122.Best Time to Buy and Sell Stock II
- hdu 3746 (kmp)
- 相关列的基数计算
- 关系数据库基础
- linux常用命令1cd、ls、快捷键、mkdir、rmdir、rm、cp、mv、cat等
- pyenv管理python多版本
- 计蒜之道 初赛 第三场 题解 Manacher o(n)求最长公共回文串 线段树
- 迁移学习( Transfer Learning )---薛贵荣
- POJ 1979 Red and Black
- 自定义标签在IE6-8的困境
- 用WCAT进行IIS压力测试
- 词法分析器总结
- codeforces 555 C Case of Chocolate
- NSRunLoop扩展阅读
- hessian入门
- linux无线网卡驱动安装
- ZOJ 3230 Solving the Problems(数学 优先队列啊)