欢迎您访问程序员文章站本站旨在为大家提供分享程序员计算机编程知识！
您现在的位置是： 首页  >  web前端

Codeforces Round #283 (Div. 2) D. Tennis Game_html/css_WEB-ITnose

程序员文章站 2022-05-14 11:51:55
...
标程貌似是二分？

我预处理标记了一下，然后从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;int in[100010];int as[100010];int ap[200010];int bs[100010];int bp[200010];int n;void maketable(){	int i,x,y;	x=y=0;	memset(ap,-1,sizeof(ap));	memset(bp,-1,sizeof(bp));	for(i=0;ibp[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   
   
51 2 1 2 1
    
   


    Output   
   
21 33 1
    
   


    Input   
   
41 1 1 1
    
   


    Output   
   
31 42 24 1
    
   


    Input   
   
41 2 1 2
    
   


    Output   
    
   


    Input   
   
82 1 2 1 1 1 1 1
    
   Output  
  
31 62 36 1
相关标签： Codeforces Round #283 (Div. 2) D. Tennis Game

上一篇： qooxdoo 0.8.1 发布：构建RIA的好工具

下一篇： 执行oracle中的job报错：ORA-12011：无法执行作业1

推荐阅读