UVA_11100_The Trip, 2007

<pre name="code" class="cpp">#include<iostream>#include<sstream>#include<string>#include<vector>#include<list>#include<set>#include<map>#include<stack>#include<queue>#include<algorithm>#pragma warning(disable:4996)#include<cstdio>#include<cstdlib>using std::cin;using std::cout;using std::endl;using std::stringstream;using std::string;using std::vector;using std::list;using std::pair;using std::set;using std::multiset;using std::map;using std::multimap;using std::stack;using std::queue;using std::priority_queue;int main(){//freopen("input.txt", "r", stdin);  //freopen("output.txt", "w", stdout);  int n;while (cin >> n&&n){int m=0;//最少大背包数vector<int>hash(1000001, 0);vector<int>bag;for (int i = 0; i < n; i++){int value; cin >> value;bag.push_back(value);hash[value]++;m = std::max(m, hash[value]);}//输出所需要最小外层背包数cout << m << endl;std::sort(bag.begin(), bag.end());vector<vector<int>>piece(m);for (size_t i = 0; i != bag.size(); i++){piece[i%m].push_back(bag[i]);}for (size_t i = 0; i!=piece.size(); i++){for (size_t j = 0; j != piece[i].size(); j++){if (j){cout << ' ';}cout << piece[i][j];}cout << endl;}cout << endl;}return 0;}