poj3617 best cow line(贪心题)
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 32687 | Accepted: 8660 |
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 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 proceeds to marshal the cows from the old line to the new one by repeatedly sending either the first or last cow in the (remainder of the) original line to the end of the new line. When he's finished, FJ takes his cows for registration in this new order.
Given the initial order of his cows, determine the least lexicographic string of initials he can make this way.
Input
* Line 1: A single integer: N
* Lines 2..N+1: Line i+1 contains a single initial ('A'..'Z') of the cow in the ith position in the original line
Output
The least lexicographic string he can make. Every line (except perhaps the last one) contains the initials of 80 cows ('A'..'Z') in the new line.
Sample Input
6
A
C
D
B
C
B
Sample Output
ABCBCD 题意:字符串头和尾取出来,组成字典序最小的字符串
题解:贪心处理,倒序比较
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<sstream>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<set>
using namespace std;
#define INF 0x3f3f3f3f
const int maxn=; int N;
char a[]; int ans=; void solve(int k)
{
ans=;
int p=,q=k-;
while(q>=p)
{
int left=;
for(int i=;i+p<=q;i++)
{
if(a[p+i]<a[q-i])
{
left=;
break;
}
else if(a[p+i]>a[q-i])
{
left=;
break;
}
}
if(left)
{
printf("%c",a[p++]);
ans++;
}
else
{
printf("%c",a[q--]);
ans++;
} if(ans%==)
cout<<endl;
}
printf("\n");
}
int main()
{ cin>>N;
getchar();
for(int i=;i<N;i++)
{
cin>>a[i];
} solve(N);
}
最新文章
- javascript 笔记!
- -Dmaven.multiModuleProjectDirectory system property is not set. Check $M2_HO 解决办法
- HDU 1062 Text Reverse(水题,字符串处理)
- 基于visual Studio2013解决C语言竞赛题之0303最大数
- Visual Studio 2017离线安装包,百度云分流
- Alamofire源码解读系列(十)之序列化(ResponseSerialization)
- 06jQuery-05-事件
- 上帝之眼APP——实时定位监控、即时通讯
- story 泄露服务器libc版本
- Xcode 10.1 运行老版本工程遇到问题解决记录
- 壁虎书1 The Machine Learning Landscape
- php实现遍历目录
- matplotlib 入门之Image tutorial
- [CF521D]Shop
- PostgresSQL使用Copy命令能大大提高数据导入速度
- rook 记录
- python socket详解
- 线段树(Segment Tree)(转)
- Eclipse启动Tomcat错误(其他类似)
- 条件注释判断浏览器<;!--[if !IE]>;