Game Prediction

来源：互联网发布：windows 网络监控编辑：程序博客网时间：2024/04/28 14:54

D - Game Prediction

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u

Submit Status

Description

Suppose there are M people, including you, playing a special card game. At the beginning, each player receives N cards. The pip of a card is a positive integer which is at most N*M. And there are no two cards with the same pip. During a round, each player chooses one card to compare with others. The player whose card with the biggest pip wins the round, and then the next round begins. After N rounds, when all the cards of each player have been chosen, the player who has won the most rounds is the winner of the game.
Given your cards received at the beginning, write a program to tell the maximal number of rounds that you may at least win during the whole game.

Input

The input consists of several test cases. The first line of each case contains two integers m (2 <= m <= 20) and n (1 <= n <= 50), representing the number of players and the number of cards each player receives at the beginning of the game, respectively. This followed by a line with n positive integers, representing the pips of cards you received at the beginning. Then a blank line follows to separate the cases.

The input is terminated by a line with two zeros.

Output

For each test case, output a line consisting of the test case number followed by the number of rounds you will at least win during the game.

Sample Input

 2 51 7 2 10 96 1162 63 54 66 65 61 57 56 50 53 480 0

Sample Output

 Case 1: 2Case 2: 4

其实这道题我也是看了题解之后才会的。这个题的大体意思就是：有M个人玩卡片游戏，每个人手里有N张卡片，同样你也有N张卡片，每个卡片对应一个数字，所有卡片上的数字范围是1~N*M，问你最多能赢几次。

#include <iostream>#include <string.h>using namespace std;bool a[1050];int main(){int m,n,cc=0,i,x;while(scanf("%d %d",&m,&n)!=EOF)    {        if(m==0&&n==0)            break;        memset(a,0,sizeof(a));         //每一次都要对数组清零；        cc++;        for(i=0;i<n;i++)        {            scanf("%d",&x);            a[x]=1;                     //记录下你手中卡片上的数字        }        int max=0,win=0;        for(i=m*n;i>0;i--)              //从最大的数往小的一个个枚举        {            if(a[i])            {                win++;                if(win>max)                    max=win;            }            else                win--;        }        printf("Case %d: %d\n",cc,max);    }return 0;}

0 0