POJ 3617 Best Cow Line

有点技巧的贪心

#include<cstdio>
#include<string>
#include<iostream>
using namespace std;
int main() {
    int n;
    char a[2005];
    string str;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int i = 0, j = n - 1;
    while (i <= j) {
		bool left = false;  //  布尔变量，判断相等的下一个，避免递归调用
		for (int x = 0; i + x <= j; x++) {
			if (a[i + x ] < a[j - x]) {
				left = true;
				break;
			} else if (a[i + x ] > a[j - x]){
				left = false;
				break;
			}
		}
        if (left) {
            str.push_back(a[i++]);
        } else {
            str.push_back(a[j--]);
        }
    }
    int count = 0;
    for (int i = 0; i < str.length(); i++) {
		printf("%c", str[i]);
		count++;
		if (count == 80) {
			count = 0;
			printf("\n");
		}
    }
    if (count) {
		printf("\n");
    }
}