该博客介绍了一个特殊卡牌游戏的策略问题，玩家需要在每轮中选择一张牌与其他玩家比较，牌面最大的玩家获胜。博主通过分析，提出了一种贪心算法来确定在给定初始卡牌的情况下，最多可以赢得多少局游戏。具体方法是记录对手手中比自己大牌的最大数量，遇到自己有大牌时消耗对手的大牌，从而计算获胜局数。
Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 10475 Accepted: 5046
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
最低0.47元/天 解锁文章
691
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
