POJ
关注
分享
扫一扫
dhm166
这个作者很懒，什么都没留下…
展开
-
POJ 3278 Catch That Cow
BFS#include#include#include#include#include#include#includeusing namespace std;int N ,K;typedef pairP;queueque;int d[200010];int bfs(){ int time=0; P p; p.first=N; p.s原创 2013-09-06 18:05:06 · 358 阅读 · 0 评论 -
POJ 3617 Best Cow Line
#include#include#include#include#include#include#includeusing namespace std;char s[4000];int N;int main(){ while(scanf("%d",&N)!=EOF) { for(int i=0;i<N;i++) {原创 2013-09-07 13:59:16 · 635 阅读 · 0 评论 -
POJ 3253 Fence Repair
#include#include#include#include#include#include#include#includeusing namespace std;int n,s;struct cmp{ bool operator ()(int x, int y) { return x > y; }};priority_que原创 2013-09-07 20:50:27 · 397 阅读 · 0 评论 -
POJ 3069 Saruman's Army
#include#include#include#include#include#include#includeusing namespace std;int R , N;int an[1010];int cmp(const void *a ,const void *b){ return *(int*)a-*(int*)b;}int main(){原创 2013-09-07 20:24:47 · 452 阅读 · 0 评论