【OJ】贪心法(最小字典序)poj3617 Best Cow Line// acmclub 12701/12695

     题目链接：      点击打开链接

/*POJ 3617 Best Cow Line贪心法——最小字典序 */#include<stdio.h>#include<string.h>char ss[30010];int main(){int n,left1;scanf("%d",&n);getchar();//不可少，接收前一个\n for(int j=0;j<n;j++){////scanf("%c",ss+j);scanf("%c",&ss[j]);//ss[j]=getchar();getchar();//不可少，接收前一个\n }int a=0,b=n-1;        int num=0;//用于换行while(a<=b){for(int i=0;a+i<=b;i++){if(ss[a+i]<ss[b-i]){left1=1;break;}else if(ss[a+i]>ss[b-i]){left1=0;break;}}if(left1)putchar(ss[a++]);else putchar(ss[b--]);                num++;                if(num%80==0)putchar('\n');//每80个换行}putchar('\n');return 0;}