Codeforces 651B Beautiful Paintings【贪心】水题
来源:互联网 发布:finalcaption mac下载 编辑:程序博客网 时间:2024/05/16 10:48
There are n pictures delivered for the new exhibition. Thei-th painting has beautyai. 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 ofa in any order. What is the maximum possible number of indicesi (1 ≤ i ≤ n - 1), such thatai + 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 thei-th painting.
Print one integer — the maximum possible number of neighbouring pairs, such thatai + 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.
题目大意:
给你N个数,你可以随意打乱序列,变成一个新的序列,使得序列中a【i】<a【i+1】的个数最多。
思路:
1、观察到n并不大,而且a【i】也不大,考虑设定vis【i】,表示数字i出现了多少次。
2、我们肯定是想要得到若干个递增序列,将重复出现的数字,规划到其他的序列中。
那么我们扫1000次从1到1000(表示最多我能够得到1000个递增序列),对应如果有一组数对:vis【i】>0&&vis【j】>0&&i<j,那么计数器加一,并且对应整个过程中,如果有vis【i/j】>0,vis【i/j】都要减一,表示这个数用于当前这个序列中了。
Ac代码:
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int vis[15151];int main(){ int n; while(~scanf("%d",&n)) { memset(vis,0,sizeof(vis)); for(int i=0;i<n;i++) { int x; scanf("%d",&x); vis[x]++; } int output=0; for(int i=1;i<=1000;i++) { int pre; int f=0; for(int j=1;j<=1000;j++) { if(vis[j]>0&&f==0) { f=1; pre=j; vis[j]--; continue; } if(vis[j]>0&&f==1) { output++; pre=j; vis[j]--; } } } printf("%d\n",output); }}
- Codeforces 651B Beautiful Paintings【贪心】水题
- codeforces 651B Beautiful Paintings(贪心)
- Codeforces 651B Beautiful Paintings【贪心】
- 【CodeForces 651B】Beautiful Paintings 排序+贪心
- 【codeforces 651B - Beautiful Paintings 】 greedy(贪心)
- codeforces 651B Beautiful Paintings(贪心)
- CodeForces 651 B.Beautiful Paintings (贪心)
- codeforces 651B B. Beautiful Paintings(贪心JAVA代码)
- 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
- 16 - 10 - 24 结构体-传递并返回结构(笔记)--《c primer plus 》
- android jack编译,代码中的中文显示乱码
- Go主要应用的系统
- HDU 5531(2015长春 icpc E.Rebuild) 计算几何
- SMP Kapsel app中applicationContext.applicationEndpointURL
- Codeforces 651B Beautiful Paintings【贪心】水题
- VS2013下OpenCV2.4.10的安装配置
- 取得浏览器页面视口大小兼容性代码
- 第九周项目3-稀疏矩阵的三元组表示的实现和应用
- uva10817 Headmaster's Headache
- Android源码编译——RK3128开发板多款红外遥控器常用按键适配
- hash table based list operation
- 关于max(X,Y),min(X,Y)
- warning: assignment makes pointer from integer without a cast