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.
5 20 30 10 50 40
4
4 200 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还能开得起。后来听别人讲解开两个队列倒换就可以了,自己真是笨死。。。。
开始代码:
#include <iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#define maxn 1010
using namespace std;
int vis[maxn];
priority_queue<int,vector<int>,greater<int> >q[maxn];
int main()
{
int d,n,ans;
while(~scanf("%d",&n))
{
ans=0;
memset(vis,0,sizeof(vis));
int cnt=0;
for(int i=0;i<n;++i)
{
while(!q[i].empty())
q[i].pop();
}
for(int i=0;i<n;++i)
{
scanf("%d",&d);
if(!vis[d])
{
vis[d]=1;
q[0].push(d);
}
else
{
q[vis[d]].push(d);
vis[d]++;
}
cnt=max(cnt,vis[d]);
}
for(int i=0;i<cnt;++i)
{
ans+=q[i].size()-1;
}
printf("%d\n",ans);
}
return 0;
}
两队列倒换代码(后来补的):
#include <iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#define maxn 1010
using namespace std;
bool vis[maxn];
priority_queue<int,vector<int>,greater<int> >q,p;
int main()
{
int n,ans,a;
while(~scanf("%d",&n))
{
ans=0;
memset(vis,0,sizeof(vis));
for(int i=0;i<n;++i)
{
scanf("%d",&a);
p.push(a);
}
while(!q.empty()||!p.empty())
{
memset(vis,false,sizeof(vis));
int cnt=0;
while(!p.empty())
{
a=p.top();
p.pop();
if(!vis[a])
{
cnt++;
vis[a]=true;
}
else
q.push(a);
}
if(cnt)
ans+=cnt-1;
memset(vis,false,sizeof(vis));
cnt=0;
while(!q.empty())
{
a=q.top();
q.pop();
if(!vis[a])
{
cnt++;
vis[a]=true;
}
else
p.push(a);
}
if(cnt)
ans+=cnt-1;
}
printf("%d\n",ans);
}
return 0;
}