綜合材料專題tennis解題報(bào)告

1、BOI2002Tennis乒乓球俱樂BOI2002Tennis乒乓球俱樂1000GI （1GI 。假設(shè)運(yùn)動(dòng)員按照在輸入數(shù)據(jù)中期望比賽場數(shù)的1 到N 編號(hào)。 SCHEDULE（SCHEDULE（ 33NON 和每個(gè)定點(diǎn)的度，要求構(gòu)造一個(gè)滿足要求的簡單圖。的點(diǎn)，算法描述和證明要簡單一些3大的點(diǎn)連線，如AN 和每個(gè)定點(diǎn)的度，要求構(gòu)造一個(gè)滿足要求的簡單圖。的點(diǎn)，算法描述和證明要簡單一些3大的點(diǎn)連線，如AB連線，但是已知解中，A,B 間卻沒有連線，相反的， A,C之間卻有邊相連，且D(B)D(C) （D表示定點(diǎn)的度 ZZBCA-CC-Z，B-ZA-B空間復(fù)雜度：O(N2)，可以降至O(N)。程序1122

2、21 2121TennisThe Matchball tennis club is organizing a “game interest week” to attract new players to the club. As one of the attractions, they have asked some star players to play a few demo games. Each star has indicated the number of games he or she is willing to play. The organizers want the sta

3、rs to have some fun as well, thus they want to schedule the games so that TennisThe Matchball tennis club is organizing a “game interest week” to attract new players to the club. As one of the attractions, they have asked some star players to play a few demo games. Each star has indicated the number

4、 of games he or she is willing to play. The organizers want the stars to have some fun as well, thus they want to schedule the games so that no two players meet thanoncewith eachYour task is to writea program to help themmatch the players into pairs so thateach player his or her desired number of ga

5、mes and does not play twice or more against any other player. Of course, no player may play against himself or herself.InputOnthe firstline ofthe inputfile tennis.inisthe numberofplayers N(2=N=1000)andonfollowing N lines is the desired number of games to GI 1 N ) for each Assumethattheplayersarenumb

6、eredfrom1toNintheorderoftheirwishesintheinputOutputOn the first line of the output file tennis.outwrite NO SCHEDULE if itis notpossible to create schedulesothatthewishesofallplayersaresatisfied,orSCHEDULEifitis If a schedule exists, write it out on the following N lines. On each line write the indices of opponents for player whose desired number of games was indicated on the corresponding input line. On each line the indices must be in increasing order and separated by spaces. If solutionsexist,outputanyoneof33NO122In this task, a program receives points In this task, a