3577298_wa.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <string>
#include <algorithm>

using namespace std;

char v[2001];
string f[2001];

string min(string a, string b)
{
	return a.compare(b) < 0 ? a : b;
}

int main()
{
	char t[1];
	int i, j, k, N;

	scanf("%d", &N);
	for(i = 0; i < N; i++)
	{
		scanf("%s",t);
		f[i] = v[i] = t[0];
	}
	for (j = 1; j < N; j++)
	{
		k = j;
		for (i = 0; k < N; i++, k++)
		{
			if (v[i] < v[k])
				f[i] = v[i] + f[i + 1];
			else
				if (v[i] > v[k])
					f[i] = v[k] + f[i];
				else
					f[i] = min(v[i] + f[i + 1], v[k] + f[i]);
		}
	}
	int length = f[0].length();
	for (i = 1; i <= length; i++)
	{
		printf("%c", f[0].at(i - 1));
		if (i % 80 == 0)
		{
			putchar('\n');
		}
	}
	if (length % 80 != 0)
	{
		putchar('\n');
	}
	return 1;
}