POJ_3617_Best Cow Line

//见《挑战程序设计竞赛》第2.2.3节

#include<stdio.h>
#define MAX_N 2000

int main() {
	int N;
	char S[MAX_N];

	scanf("%d", &N);
	for (int i = 0; i < N; i++) scanf("\n%c", S + i);

	int a = 0, b = N - 1, cnt = 0;
	while (a <= b) {
		bool left = false;
		for (int i = 0; a + (i << 1) <= b; i++) {
			if (S[a + i] < S[b - i]) {
				left = true;
				break;
			}
			else if (S[a + i] > S[b - i]) {
				left = false;
				break;
			}
		}

		if (left) putchar(S[a++]);
		else putchar(S[b--]);

		cnt++;
		if (cnt == 80) {
			putchar('\n');
			cnt = 0;
		}
	}

	return 0;
}