Best Cow Line
http://202.117.21.117/xjoj/problem_html/101.html
1 #include <iostream> 2 #include <stdio.h> 3 #define N 30003 4 using namespace std; 5 char data[N]; 6 int put(int a,int b) 7 { 8 while(a<b && data[a]==data[b])a++,b--; 9 return data[a]<data[b]; 10 } 11 int main() 12 { 13 int n; 14 while(~scanf("%d", &n)) 15 { 16 int i,cnt=0; 17 for(i=0; i<n; i++) 18 scanf(" %c", data+i); 19 int a=0,b=n-1; 20 while(cnt < n) 21 { 22 if(put(a,b)) 23 { 24 putchar(data[a++]); 25 cnt++; 26 } 27 else 28 { 29 putchar(data[b--]); 30 cnt++; 31 } 32 if(!(cnt%80)) 33 putchar('\n'); 34 } 35 if(cnt%80) 36 putchar('\n'); 37 } 38 return 0; 39 }