UVa11100 The Trip, 2007

Problem A: The Trip, 2007

A number of students are members of a club that travels annually to exotic locations. Their destinations in the past have included Indianapolis, Phoenix, Nashville, Philadelphia, San Jose, Atlanta, Eindhoven, Orlando, Vancouver, Honolulu, Beverly Hills, Prague, Shanghai, and San Antonio. This spring they are hoping to make a similar trip but aren't quite sure where or when.

An issue with the trip is that their very generous sponsors always give them various knapsacks and other carrying bags that they must pack for their trip home. As the airline allows only so many pieces of luggage, they decide to pool their gifts and to pack one bag within another so as to minimize the total number of pieces they must carry.

The bags are all exactly the same shape and differ only in their linear dimension which is a positive integer not exceeding 1000000. A bag with smaller dimension will fit in one with larger dimension. You are to compute which bags to pack within which others so as to minimize the overall number of pieces of luggage (i.e. the number of outermost bags). While maintaining the minimal number of pieces you are also to minimize the total number of bags in any one piece that must be carried.

Standard input contains several test cases. Each test case consists of an integer 1 ≤ n ≤ 10000 giving the number of bags followed by n integers on one or more lines, each giving the dimension of a piece. A line containing 0 follows the last test case. For each test case your output should consist of k, the minimum number of pieces, followed by k lines, each giving the dimensions of the bags comprising one piece, separated by spaces. Each dimension in the input should appear exactly once in the output, and the bags in each piece must fit nested one within another. If there is more than one solution, any will do. Output an empty line between cases.

Sample Input

6
1 1 2 2 2 3
0

Output for Sample Input

3
1 2
1 2
3 2

---

Troy Vasiga, Graeme Kemkes, Ian Munro, Gordon V. Cormack

题目大意：给定N个整数，把他们划分成尽量少的严格递增序列。

题解：先对N个数进行升序排序，然后统计出数量最多的那个元素的数量K，则K就是序列个数，因为相同的元素是不能放在同一个序列中的。之后就是构造出每个序列。方法很巧妙，具体请参看程序。

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAXN 1000005
long a[10005];
long ans[MAXN];
long n;
int compare(const void*a,const void*b)
{
    return *(int*)a-*(int*)b;
}
int main(void)
{
    long i,j,k,m;
    while(scanf("%ld",&n)!=EOF)
    {
        if(n==0) break;
        for(i=0; i<n; i++)
            scanf("%ld",&a[i]);
        memset(ans,0,sizeof(ans));
        k=-1;
        for(i=0;i<n;i++)
        {
            ans[a[i]]++;
            if(ans[a[i]]>k) k=ans[a[i]];
        }
        m=n/k+2;
        long f[k+1][m];
        qsort(a,n,sizeof(a[0]),compare);
        memset(f,0,sizeof(f));
        for(i=0;i<n;i++)
        {   f[i%k][0]++;
            f[i%k][f[i%k][0]]=a[i];
        }
        printf("%ld\n",k);
        for(i=0;i<k;i++)
        {
            for(j=1;j<f[i][0];j++)
            printf("%ld ",f[i][j]);
            printf("%ld\n",f[i][j]);
        }
    }
    return 0;
}