1040: 二哥的困惑 Ⅲ
]
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 5
1 7 2 10 9
6 11
62 63 54 66 65 61 57 56 50 53 48
0 0
Sample Output
Case 1: 2
Case 2: 4
HINT
题意:m个玩家,给你n张牌,所有牌的编号为1-m*n。给你你所拥有的牌,每人每局出一张牌,问,你至少能赢几把。
如果你有最大的牌那你肯定是赢得,如果没有那么就是输。
Code:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
int n,m;
int cas=1;
int x[1005];
while(~scanf("%d %d",&m,&n))
{
if(n==0&&m==0)
break;
memset(x,0,sizeof(x));
for(int i=0; i<n; i++)
{
int a;
scanf("%d",&a);
x[a]=1;
}
int sum=0,maxx=0;
for(int i=n*m; i>0; i--)
{
if(x[i])
{
sum++;
if(sum>maxx)
maxx=sum;
}
else
sum--;
}
printf("Case %d: %d\n",cas++,maxx);
}
return 0;
}