摘要: /** poj 3253 Fence Repair* 05.06/2014*/#include #include #include #define MAXN 30000using namespace std;int N;int a[MAXN];void solve(){ long long ... 阅读全文
posted @ 2014-05-06 16:41 Difei 阅读(179) 评论(0) 推荐(0) 编辑
摘要: /** poj 3069 Saruman's Army* 05.05/2014*/#include #include //for memset#include #define MAXN 4000#define INF 100000000using namespace std;int N,R;int ... 阅读全文
posted @ 2014-05-06 16:33 Difei 阅读(149) 评论(0) 推荐(0) 编辑
摘要: /** poj 3617 best cow line* 05.05/2014*/#include #include #define MAXN 4000int N;char ca[MAXN];void solve(){ int starti = 0,endi = N-1; int ... 阅读全文
posted @ 2014-05-06 16:28 Difei 阅读(222) 评论(0) 推荐(0) 编辑