codeforces #345 div.2 B Beautiful Paintings
2016-03-08 10:59
411 查看
B. Beautiful Paintings
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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.
Output
Print one integer — the maximum possible number of neighbouring pairs, such that ai + 1 > ai,
after the optimal rearrangement.
Examples
input
output
input
output
Note
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.
仔细观察后易发现,对于一个不含重复元素的集合来说,产生的最大幸福度是集合元素个数-1;那么只要把输入元素划分为数个不含相同元素的集合,分别求解即可;
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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.
Output
Print one integer — the maximum possible number of neighbouring pairs, such that ai + 1 > ai,
after the optimal rearrangement.
Examples
input
5 20 30 10 50 40
output
4
input
4200 100 100 200
output
2
Note
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.
仔细观察后易发现,对于一个不含重复元素的集合来说,产生的最大幸福度是集合元素个数-1;那么只要把输入元素划分为数个不含相同元素的集合,分别求解即可;
#include<bits/stdc++.h> using namespace std; int main() { int n; scanf("%d",&n); bool s[1001][1001]={0}; int num[1001]={0}; int col=0; int temp; for(int i=0;i<n;++i) { scanf("%d",&temp); for(int j=1;j<=1000;++j) { if(s[j][temp]==0) { s[j][temp]=1; ++num[j]; if(j>col) ++col; break; } } } int ans=0; for(int i=1;i<=col;++i) { ans+=num[i]-1; } printf("%d\n",ans);
return 0; }
相关文章推荐
- Codeforces Round #345 (Div. 2) B. Beautiful Paintings 暴力
- 从Ibatis过渡到Mybatis-比较Mybaits较与Ibatis有哪些方面的改进
- Saiku如何固定查询结果table的表头和首列
- C:CLOSE_WAIT状态的原因与解决方法
- 126.View the Exhibit and examine the data in the PROJ_TASK_DETAILS table.
- RBS创建了“人工”AI聊天系统,叫做Luvo用来处理工作人员的问题
- [LeetCode]70. Climbing Stairs
- AlphaGo对战李世石谁能赢?两万字长文深挖围棋AI技术(一)
- AlphaGo对战李世石谁能赢?两万字长文深挖围棋AI技术(二)
- CodeForces 651B Beautiful Paintings
- Failure [INSTALL_FAILED_OLDER_SDK]
- codeforces 651B beautiful_Painting
- 人工智能技术的黄金时代,真的来了吗?
- Codeforces Round #345 (Div. 2) B. Beautiful Paintings
- Codeforces 651B Beautiful Paintings(不可思议的暴力)
- composer报错:Failed to decode response: zlib_decode(): data error
- codeforces 651B B. Beautiful Paintings
- Get Paid to Read Ads with 7 Most Trusted PTC Sites
- presenter on rails
- CodeForces - 630A Again Twenty Five! (水)