poj 3617 Best Cow Line
摘要：http://poj.org/problem?id=3617 #include
#include
#include
#include
#include
using namespace std; const int MAX_N=2000;
char S[MAX_N+1];
int N;
int main()
{ cin>>N; for(int i=0;i>S[i]; ...
阅读全文
posted @ 2015-03-17 13:41
