Cpp环境【POJ3623】【Usaco2007Dec】【Vijos2993】Best Cow Line, Gold 最佳队列[2]

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

cqyz_Lebmond

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

阅读量661

点赞数 1

分类专栏：基础算法之五贪婪的心难度评级 Lower than Average 文章标签： poj vijos 贪心算法 Usaco

本文链接：https://blog.csdn.net/arkhamorginal/article/details/52033679

版权

FJ要在"Farmer of the Year"比赛中调整奶牛队列，以达到最小字典序。他通过在旧队列首尾选择奶牛放入新队列尾部。给定奶牛初始顺序，找出按FJ规则调整后的最小字典序队列。这是一个贪心问题，需要每次选择字典序最小的奶牛。代码实现已给出。

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

POJ3623 Best Cow Line，Gold 原题

Description  问题描述

FJ is about to take his N (1 ≤ N ≤ 30,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 phase ends, every group is judged in increasing lexicographic order according to the string of the initials of the cows’ names.
FJ is very busy this year and has to hurry back to his farm, so he wants to be judged as early as possible. He decides to rearrange his cows, who have already lined up, before registering them.
FJ marks a location for a new line of the competing cows. He then