华电北风吹
天津大学认知计算与应用重点实验室
2016-08-11
题目链接:
http://hihocoder.com/problemset/problem/1356
题目分析:
总体思路,贪心求解,从前往后每次选取可以选的最小的数。这里的包括两个条件:其一,不能与前一个重复;其二,保证有解。保证有解技巧是当剩余的位置数正好能够满足个数最大的那个数隔空插入时这个位置一定要放个数最大的那个数,其他条件按照条件一安排即可。
实现的时候我用了map,也挺快,没超时,顺利ac。
参考代码:
#include <iostream>
#include <string.h>
#include <map>
using namespace std;
int data[100005];
int result[100005];
void FindMaxNumAndCount(map<int, int> &m, int &maxNum, int &maxCount)
{
maxCount = 0;
map<int, int>::iterator it;
for (it = m.begin(); it != m.end(); it++)
{
if (it->second > maxCount)
{
maxNum = it->first;
maxCount = it->second;
}
}
}
int main()
{
memset(data, 0, sizeof(data));
memset(result, 0, sizeof(result));
int N;
cin >> N;
map<int, int> countNum;
for (int i = 0; i < N; i++)
{
cin >> data[i];
countNum[data[i]]++;
}
int maxNum = 0, maxCount = 0;
FindMaxNumAndCount(countNum, maxNum, maxCount);
if (2 * maxCount > N + 1)
{
cout << "-1" << endl;
return 0;
}
map<int, int>::iterator it;
for (int i = 1; i <= N; i++)
{
if (N - i + 2 == 2 * maxCount)
{
result[i] = maxNum;
countNum[maxNum]--;
FindMaxNumAndCount(countNum, maxNum, maxCount);
continue;
}
for (it = countNum.begin(); it != countNum.end(); it++)
{
if (it->first != result[i - 1])
{
result[i] = it->first;
it->second--;
if (it->first == maxNum)
{
FindMaxNumAndCount(countNum, maxNum, maxCount);
}
if (it->second == 0)
{
countNum.erase(it);
}
break;
}
}
}
for (int i = 1; i < N; i++)
{
cout << result[i] << " ";
}
cout << result[N] << endl;
return 0;
}