UVALive 4683(鸽巢原理 O（n））

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100000+5;
int n;
pair<int,int> P[maxn];
int s[maxn];
int main()
{
    scanf("%d",&n);
    int sum = 0 ;
    for(int i = 1 ; i <= n ; i++)
    {
        scanf("%d",&s[i]);
        sum += s[i];
        sum %= n;
        P[i] = make_pair(sum,i);
    }
    sort(P+1,P+1+n);
    for(int i = 1 ; i <= n ; i++)
    {
        if(P[i].first == 0)
        {
            cout << P[i].second << endl;
            for(int j = 1 ; j <= P[i].second ; j++)
            {
                cout << s[j] << endl;
            }
            return 0;
        }
        if(P[i].first == P[i+1].first && i != n)
        {
            cout << max(P[i].second,P[i+1].second) - min(P[i].second,P[i+1].second)  << endl;
            for(int j = min(P[i].second,P[i+1].second) + 1 ; j <= max(P[i].second,P[i+1].second) ; j++)
            {
                cout << s[j] << endl;
            }
            return 0;
        }
    }
}