POJ3617Best Cow Line(贪心)

最新推荐文章于 2020-05-08 11:11:57 发布

森屿北海

最新推荐文章于 2020-05-08 11:11:57 发布

阅读量209

点赞数 1

分类专栏： ACM_POJ 文章标签： ACM 贪心

本文链接：https://blog.csdn.net/qq_38121348/article/details/72633260

版权

FJ需要将他的奶牛按照字典序尽可能小的顺序排列参加比赛。他可以从前或后取奶牛并添加到新队列的末尾。问题求解通过比较S和反转后的S，贪心地选择较小的字符添加到T的末尾。

摘要由CSDN通过智能技术生成

传送门：http://poj.org/problem?id=3617

Best Cow Line

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 23932		Accepted: 6498

Description

FJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual"Farmer of the Year" competition. In this contest every farmer arranges his cows in a line and herds them past the judges.

The contest organizers adopted a new registration scheme this year: simply register the initial letter of every cow in the order they will appear (i.e., If FJ takes Bessie, Sylvia, and Dora in that order he just registers BSD). After the registration