CodeforcesRound#283(Div.2)D.TennisGame_html/css

來源：懂視網責編：小采時間：2020-11-27 16:00:03

CodeforcesRound#283(Div.2)D.TennisGame_html/css

CodeforcesRound#283(Div.2)D.TennisGame_html/css_WEB-ITnose:標程貌似是二分？我預處理標記了一下，然后從1到n枚舉t，因為對于每個t，若s存在，那么s是唯一的，所以枚舉t即可。判斷t是否合法，直接暴力的話，會超時不知道標程大致思想是否跟我的一樣，也許就是標程沒有標記而是二分來找但是，我的時間復雜度

推薦度：

點擊下載本文 文檔為doc格式

導讀CodeforcesRound#283(Div.2)D.TennisGame_html/css_WEB-ITnose:標程貌似是二分？我預處理標記了一下，然后從1到n枚舉t，因為對于每個t，若s存在，那么s是唯一的，所以枚舉t即可。判斷t是否合法，直接暴力的話，會超時不知道標程大致思想是否跟我的一樣，也許就是標程沒有標記而是二分來找但是，我的時間復雜度

標程貌似是二分？

我預處理標記了一下，然后從1到n枚舉t，因為對于每個t，若s存在，那么s是唯一的，所以枚舉t即可。

判斷t是否合法，直接暴力的話，會超時

不知道標程大致思想是否跟我的一樣，也許就是標程沒有標記而是二分來找

但是，我的時間復雜度是更優的，n*(1+1/2+1/3+......1/n)=n*lnn的做法

#include#include#include#include#include#include#include#include#include#includeusing namespace std;struct Ans{	int s,t;	Ans(){}	Ans(int a,int b){s=a;t=b;}	bool operator <(Ans x)const	{	return s!=x.s?sbp[t2]))	{	t1=as[bp[t2]]+s;	t2+=s;	y++;	}	else	return 0;	}}int main(){	int i,t,m;	scanf("%d",&n);	for(i=0;i

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 ofs sets, he wins the match and the match is over. Heres and t are some positive integer numbers.

To spice it up, Petya and Gena choose new numbers s andt 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 winss 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 numberss and t for the given match are also lost. The players now wonder what values ofs 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 integersai. Ifai?=?1, then thei-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 numberss and t corresponds to the given record.

Output

In the first line print a single number k ? the number of options for numberss and t.

In each of the following k lines print two integerssi andti ? the option for numberss and t. Print the options in the order of increasingsi, and for equalsi ? in the order of increasingti.

Sample test(s)

Input