UVA - 11100 The Trip, 2007

题目大意：有n个包，大包能套小包，问最多能套成几个。

解题思路：贪心，数量最多的包肯定作为基准个数，然后去套即可。

#include <iostream>#include <algorithm>using namespace std;int main() {int n;while (cin >> n && n) {int A[10005] = {0};for (int i = 0; i < n; i++)cin >> A[i];sort(A, A + n);int cur = 0, MAX = 0;for (int i = 1; i <= n; i++)if (A[i] != A[i-1]) {MAX = max(MAX, i - cur);cur = i;}cout << MAX << endl;for (int i = 0; i < MAX; i++) {cout << A[i];for (int j = i + MAX; j < n; j += MAX)cout << " " << A[j];cout << endl;}}return 0;}