在本地上用vs测试一些小数据都是对的（应该是个小错误但是一直没找到）：

/** poj 3617 best cow line一直WA
* 05.05/2014
*/
#include <stdio.h>
#include <string.h>

#define MAXN 4000
#define INF 100000000


int N;
char ca[MAXN];


void solve()
{	
	int starti = 0,endi = N-1;
	int count = 0;
	while (starti <= endi)
	{	
		for(int i =0; starti + i <= endi; i++)
		{
			if(ca[starti + i] <= ca[endi-i])
			{
				putchar(ca[starti ++]);count++;
				break;
			}
			else
			{
				putchar(ca[endi --]);count++;
				break;
				
			}

		}
		if(count == 80)
		{
			putchar('\n');
			count =0;
		}
	}
	putchar('\n');
	return;
}
int main()
{	
	scanf("%d",&N);
	//scanf("%s",ca);
	for(int i = 0; i < N; i++)
		scanf("\n%c",&ca[i]);
	solve();

	return 0;
	
}

• Re:3617一直WA (519) Difei 2014-05-06 12:22:23