Game Prediction
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 12188 Accepted: 5873
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?20) and n (1?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
题目链接:http://poj.org/problem?id=1323
题意:有m个人,每个人手上有n张牌,进行游戏,牌上的数是1至m*n之间不重复的数,每轮每人出一张牌,数值最大的人赢下这局,现在给出你手上的所有牌,问你最少能赢几局
solution:用最坏情况分析、但你出最大的牌时、别人一有比你大的牌就来压你
#include <bits/stdc++.h>
using namespace std;
int main()
{
int m, n, win, lost, cas = 0;
int arr[51] = {0};
while (cin >> m >> n){
if (!m && !n)return 0;
for (int i = 1; i <= n; ++i)scanf("%d", &arr[i]);
arr[0] = 0;
arr[n + 1] = n * m + 1;
sort(arr, arr + n + 2);
win = 0, lost = 0;
for (int i = n; i >= 1; --i){
lost += arr[i + 1] - arr[i] - 1;
if (!lost)++win;
else --lost;
}
printf("Case %d: %d\n", ++cas, win);
}
}