POJ3617-Best Cow Line

 1 #include <iostream>
 2 #include <cstdio>
 3 using namespace std;
 4 
 5 int N;
 6 char S[2100];
 7 
 8 void solve()
 9 {
10     int left = 0, right = N-1;
11     bool left_flag = false;
12 
13     while (left <= right)
14     {
15         for (int i = 0; left+i <= right; i++)
16         {
17             if (S[left+i] < S[right-i])
18             {
19                 left_flag = true;
20                 break;
21             }
22             else if (S[left+i] > S[right-i])
23             {
24                 left_flag = false;
25                 break;
26             }
27         }
28         if (left_flag) putchar(S[left++]);
29         else putchar(S[right--]);
30     }
31     putchar(‘\n‘);
32 }
33 
34 int main()
35 {
36     cin >> N;
37     for (int i = 0; i < N; i++)
38         cin >> S[i];
39 
40     solve();
41 
42     return 0;
43 }