Best Cow Line (贪心)
来源:互联网 发布:ubuntu开启root账户 编辑:程序博客网 时间:2024/06/13 23:11
Best Cow Line
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.
* 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
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.
6ACDBCB
ABCBCD
题意:从首和尾依次选相对小的输出,如果相等,就比较下两个,如果都相等,则输出任意一个
AC代码:
#include<iostream>#include<cstdio>#include<cstring>#include<math.h>#include<algorithm>#define maxn 5005using namespace std;char a[maxn];int main(){int n;while(scanf("%d",&n)!=EOF){getchar();for(int i=1;i<=n;++i){scanf("%c",&a[i]);getchar();}int st=1,ed=n,flag=0;while(st<=ed){int k=0;int leap=1;while(st+k<=ed-k){if(a[st+k]<a[ed-k]){break;}if(a[st+k]>a[ed-k]){leap=0;break;}k++;}flag++;if(leap)printf("%c",a[st++]);elseprintf("%c",a[ed--]);if(flag%80==0)printf("\n");}if(flag%80!=0)printf("\n");}return 0;}
大佬stl写法:
#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>#include<set>using namespace std;int main(){ set<int> pr; set<int>::iterator it; set<int>::iterator en; int i,t,n,r,m,x,f[1002],a; while(scanf("%d %d",&r,&n)&&(n!=-1||r!=-1)){ t=0; pr.clear(); for(i=0;i<n;i++){ scanf("%d",&x); pr.insert(x); } while(it!=pr.end()||!pr.empty()){ t++; it=pr.begin(); a=(*it)+r; for(it=pr.begin();*it<=a&&it!=pr.end();it++); it--; a=(*it)+r; for(it=pr.begin();it!=pr.end();it++){ if(*it<=a); else { en=it; break; } } if(it==pr.end()) break; else {it=pr.begin(); pr.erase(it,en);} } printf("%d\n",t); } return 0;}
- Best Cow Line (贪心)
- POJ - Best Cow Line(贪心)
- POJ 3617 - Best Cow Line(贪心)
- poj 3617 Best Cow Line(贪心)
- poj3623 Best Cow Line, Gold(贪心)
- POJ 3617 Best Cow Line(贪心)
- POJ 3617 Best Cow Line (贪心)
- POJ 3617 Best Cow Line (贪心)
- POJ 3617 Best Cow Line(贪心)
- POJ 3617 Best Cow Line(贪心)
- poj3617 Best Cow Line (贪心)
- poj3617 Best Cow Line(贪心+字符串)
- 3069 Best Cow Line(贪心算法)
- poj 3617 Best Cow Line(贪心)
- poj3617 Best Cow Line 贪心
- POJ3617 Best Cow Line 贪心
- poj3617 Best Cow Line 贪心
- Best Cow Line ---- 贪心算法
- BDTC 2017 | 中国大数据技术大会全日程和讲师曝光
- Well, Signor Hugo, are you ready--are you willing to help me?"
- How to Structure a Scalable And Maintainable Acceptance Test Suite
- 资源 | 亚马逊 AI 主任科学家李沐:动手学深度学习视频大全
- AI一分钟 | 马斯克:我不是中本聪,我自己的比特币都丢了;商汤科技再获阿里巴巴15亿元投资,内部消息称C轮还有更大巨头入股
- Best Cow Line (贪心)
- TMS320F28335---外部按键中断
- 剑指offer从头到尾打印链表
- 习题7
- Flink学习笔记:3、Flink分布式模式(Standalone)
- 计组
- java心得(深克隆和浅克隆)
- 【Android开发笔记】创建和使用Android库
- HTML表单