【CodeForces】651B - Beautiful Paintings(暴力)
来源:互联网 发布:找女朋友的软件 编辑:程序博客网 时间:2024/06/06 03:39
题目链接:点击打开题目
There are n pictures delivered for the new exhibition. The i-th painting has beauty ai. We know that a visitor becomes happy every time he passes from a painting to a more beautiful one.
We are allowed to arranged pictures in any order. What is the maximum possible number of times the visitor may become happy while passing all pictures from first to last? In other words, we are allowed to rearrange elements of a in any order. What is the maximum possible number of indices i (1 ≤ i ≤ n - 1), such that ai + 1 > ai.
The first line of the input contains integer n (1 ≤ n ≤ 1000) — the number of painting.
The second line contains the sequence a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai means the beauty of the i-th painting.
Print one integer — the maximum possible number of neighbouring pairs, such that ai + 1 > ai, after the optimal rearrangement.
520 30 10 50 40
4
4200 100 100 200
2
In the first sample, the optimal order is: 10, 20, 30, 40, 50.
In the second sample, the optimal order is: 100, 200, 100, 200.
数据才1000,两次for循环暴力计算使之递增即可。
代码如下:
#include <cstdio>int main(){int n;int a[1111] = {0};int ans = 0;scanf ("%d",&n);while (n--){int t;scanf ("%d",&t);a[t]++;}for (int i = 1 ; i <= 1000 ; i++){int cnt = 0;for (int i = 1 ; i <= 1000 ; i++){if (a[i]){cnt++;a[i]--;}}if (cnt == 1 || cnt == 0)break;ans += cnt - 1;}printf ("%d\n",ans);return 0;}
- 【CodeForces】651B - Beautiful Paintings(暴力)
- Codeforces 651B Beautiful Paintings(不可思议的暴力)
- codeforces 651B Beautiful Paintings(贪心)
- CodeForces 651 B.Beautiful Paintings (贪心)
- Codeforces Round #345 (Div. 2)-B. Beautiful Paintings(暴力)
- codeforces--651B Beautiful Paintings
- codeforces 651B Beautiful Paintings
- CodeForces 651B Beautiful Paintings
- codeforces 651B Beautiful Paintings
- CodeForces 651B Beautiful Paintings
- 【CodeForces】651B - Beautiful Paintings
- 【CodeForces】[651B]Beautiful Paintings
- CodeForces 651B Beautiful Paintings
- CodeForces 651B Beautiful Paintings
- Codeforces 651B Beautiful Paintings
- codeforces 651B Beautiful Paintings (想法)
- codeforces 651B Beautiful Paintings【优先队列】
- Codeforces 651B Beautiful Paintings【思维】
- android stuio中布局预览错误解决方法
- Android 5 消息机制源码分析
- hdu3709Balanced Number【数位dp记忆化搜索】
- HDU 5437 Alisha’s Party
- Gof 设计模式 结构型
- 【CodeForces】651B - Beautiful Paintings(暴力)
- 面试题30
- 【bzoj1179】[Apio2009]Atm
- 自定义控件实现水波纹效果
- Servlet中的Filter详解
- Android屏幕适配总结
- Android数据库 之 SQLite数据库
- “甩老族”现象。
- 游戏知识略解