题解报告
EdwardDean
这个作者很懒,什么都没留下…
展开
-
POJ 3617 Best Cow Line [贪心] 《挑战程序设计竞赛》2.2
#include <iostream> #include <cstdio> #define MAX_N 2005 using namespace std; int N; char S[MAX_N]; void solve() { int a = 0, b = N-1; int cnt = 0; while(a <= b) { bool left = f原创 2017-07-03 21:48:24 · 108 阅读 · 0 评论 -
POJ 3617 Best Cow Line [贪心] 《挑战程序设计竞赛》2.2
#include <iostream> #include <cstdio> #define MAX_N 2005 using namespace std; int N; char S[MAX_N]; void solve() { int a = 0, b = N-1; int cnt = 0; while(a <= b) { bool left = f原创 2017-07-03 21:52:05 · 188 阅读 · 0 评论