poj1323解题报告

最新推荐文章于 2020-03-13 23:30:01 发布

隔山忘己

最新推荐文章于 2020-03-13 23:30:01 发布

阅读量1.4k

点赞数 1

分类专栏：贪心文章标签： poj 贪心

本文链接：https://blog.csdn.net/u013343013/article/details/41768499

版权

贪心专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Game Prediction

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 9689		Accepted: 4630

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

源代码：

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int n,m,i,t;
	int num,flag,c=1;
	int a[200];
	while (cin>>n>>m && n!=0 && m!=0)
	{
	   t=0;num=0;flag=0;
	   for (i=1;i<=m;i++)
	   {
	       cin>>a[i];
	   }
	   sort(a+1,a+1+m);
	   for (i=n*m;i>0;i--)
	   {
	       if (a[m]!=i)
			   num++;
		   else 
		   {
		       if (num)
				   num--;
			   else
				   t++; 
			   m--;
		   }
		   if (m<0) {break;}
	   }
	   cout<<"Case "<<c++<<": "<<t<<endl;
	}	
	return 0;
}

本题题意，模拟打牌的题目，给出n个人，每个人有m张牌数，牌的最大值为n*m，最小值为1，每次没人打出一张牌，最大的那个人胜出，给出你的所有的m张牌，你设计程序计算出你最多能赢多少场。

解题思路：简单的贪心算法，因为所有牌的值你都知道，所以首先判断你又多少张牌没有，从最大的开始判断，如果最大的你有了，你就肯定会获胜，如果最大有了，第二没有，3，4,5大的都有，说明你至少会赢2局，我的思路是，从最大的n*m开始判断你有没有，没有就用num来记录，当你有，t才++，最后输出t就行，一开始我把m--写在了else外面，死活不过，后来发现m--是必须判断到有相同的值才能自减，这个大家相同就容易多了，还是比较推荐大家试试的。