Codeforces 496D Tennis Game(二分)

D. Tennis Game

time limit per test

 2 seconds

memory limit per test

 256 megabytes

input

 standard input

output

 standard output

Petya and Gena love playing table tennis. A single match is played according to the following rules: a match consists of multiple sets, each set consists of multiple serves. Each serve is won by one of the players, this player scores one point. As soon as one of the players scores t points, he wins the set; then the next set starts and scores of both players are being set to 0. As soon as one of the players wins the total of s sets, he wins the match and the match is over. Here s and t are some positive integer numbers.

To spice it up, Petya and Gena choose new numbers s and t before every match. Besides, for the sake of history they keep a record of each match: that is, for each serve they write down the winner. Serve winners are recorded in the chronological order. In a record the set is over as soon as one of the players scores t points and the match is over as soon as one of the players wins s sets.

Petya and Gena have found a record of an old match. Unfortunately, the sequence of serves in the record isn't divided into sets and numbers s and t for the given match are also lost. The players now wonder what values of s and t might be. Can you determine all the possible options?

Input

The first line contains a single integer n — the length of the sequence of games (1 ≤ n ≤ 105).

The second line contains n space-separated integers ai. If ai = 1, then the i-th serve was won by Petya, if ai = 2, then the i-th serve was won by Gena.

It is not guaranteed that at least one option for numbers s and t corresponds to the given record.

Output

In the first line print a single number k — the number of options for numbers s and t.

In each of the following k lines print two integers si and ti — the option for numbers s and t. Print the options in the order of increasingsi, and for equal si — in the order of increasing ti.

Sample test(s)

input

5
1 2 1 2 1

output

2
1 3
3 1

input

4
1 1 1 1

output

3
1 4
2 2
4 1

input

4
1 2 1 2

output

0

input

8
2 1 2 1 1 1 1 1

output

3
1 6
2 3
6 1

题意：

两个人进行网球比赛，赢一球得一分，每局有T分，一局胜利后比分会被刷新两个人的分数都重新赋为0，当某人赢够S局后比赛结束；现在输入n个数，表示一场比赛中两个人的分别得分，1表示Petya , 2表示Gena. 要求依据这组得分输出所有可能的比分回合制度，顺序为以S递增，S相同以T递增。

思路：

借鉴了别人的思路，直接暴力了T的值，枚举了T的值后可以二分两个人有人胜出时的分数，这里我用的是把两个人的分数都用前缀和处理一下，找出来后比较两个人那个完成的比较早，就赢得比赛。这一题有挺多情况有特判的，挺烦的。。。

代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int ,int > P;
const int MAX_N = 1e5+9;
int vec1[MAX_N];
int vec2[MAX_N];
vector <P> out;
bool cmp(const P&A,const P&B)
{
    if(A.first!=B.first) return A.first <B.first;
    else return A.second < B.second;
}
int main()
{
    int N,M,T;
    while(cin>>N)
    {
        memset(vec1,0,sizeof(vec1));
        memset(vec2,0,sizeof(vec2));
        out.clear();
        int win = 0;
        for(int i=1; i<=N; i++)
        {
            scanf("%d",&T);
            if(i == N)
            {
                if(T == 1 ) win = 1;
                else win = 2;
            }
            if(T == 1) vec1[i] = 1;
            else vec2[i] = 1;
            vec1[i] += vec1[i-1];
            vec2[i] += vec2[i-1];
            //cout<<vec1[i]<<"....."<<vec2[i]<<endl;
        }
        //cout<<vec1[N]<<"...."<<vec2[N]<<endl;
        if(vec1[N] == vec2[N])
        {
            printf("0\n");
            continue;
        }
        int ans = 0;

        for(int t=1; t<=max(vec1[N],vec2[N]); t++)
        {
            int p1 = 0;
            int p2 = 0;
            int num1 = 0;
            int num2 = 0;
            while(1)
            {

                p1 += t;
                p2 += t;
                if(p1 > vec1[N] && p2 > vec2[N]) break;
                int a = lower_bound(vec1+1,vec1+N+1,p1)-vec1;
                int b = lower_bound(vec2+1,vec2+N+1,p2)-vec2;
                if(a<b) num1++;
                else num2++;
                int res = min(a,b);

                //cout<<t<<"     "<<a<<"....."<<b<<endl;
                if(res >= N)
                {
                    if(num1 != num2  )
                    {
                        if(num1 > num2 && win == 2) break;
                        else if(num1<num2 && win == 1) break;
                        //cout<<num1<<"...."<<endl;
                        ans ++;
                        out.push_back(make_pair(max(num1,num2),t));
                    }
                    break;
                }
                p1 = vec1[res];
                p2 = vec2[res];
            }

        }
        cout<<ans<<endl;
        int s = out.size();
        sort(out.begin(),out.end(),cmp);
        for(int i=0;i<out.size();i++)
        {
            cout<<out[i].first<<" "<<out[i].second<<endl;
        }
    }
    return 0;
}