UVa 11100 旅行2007

https://vjudge.net/problem/UVA-11100

题意：

给定n个正整数，把它们划分成尽量少的严格递增序列，尽量均分。

思路：

因为必须严格递增，所以先统计每个数字出现的次数，次数最多的就是要划分的序列个数。

接下来每次用最多次数作为步长划分，很巧妙。

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;

const int maxn = 10000 + 5;
int a[maxn];
int vis[maxn];
vector<int> c[maxn];

int n;

int main()
{
    //freopen("D:\txt.txt", "r", stdin);
    int kase = 0;
    while (cin >> n && n)
    {
        if (kase)   cout << endl;
        kase = 1;
        memset(vis, 0, sizeof(vis));
        for (int i = 1; i <= n; i++)
        {
            cin >> a[i];
            vis[a[i]]++;
        }
        int cnt = 0;
        for (int i = 1; i <= n; i++)
        {
            cnt = max(cnt, vis[a[i]]);
        }
        sort(a+1, a + n + 1);
        cout << cnt << endl;
        for (int i = 1; i <= cnt; i++)
        {
            int first = 1;
            for (int j = i; j <= n; j += cnt)
            {
                if (first)
                {
                    cout << a[j];
                    first = 0;
                }
                else   cout << " " << a[j];
            }
            cout << endl;
        }
    }
}