码迷,mamicode.com
首页 >  
搜索关键字:poj 3469    ( 20310个结果
Arctic Network POJ - 2349
#include<cstring> #include<iostream> #include<algorithm> #include<cmath> #include<cstdio> #define x first #define y second using namespace std; typede ...
分类:Web程序   时间:2020-01-29 15:56:54    阅读次数:65
挑战程序设计竞赛2.3习题:Cow Exhibition POJ - 2184
"Fat and docile, big and dumb, they look so stupid, they aren't muchfun..."- Cows with Guns by Dana LyonsThe cows want to prove to the public that the ...
分类:其他好文   时间:2020-01-29 15:55:06    阅读次数:107
Borg Maze POJ - 3026
#include<iostream> #include<stdio.h> #include<cstring> #include<queue> using namespace std; typedef pair<int,int>PII; //原地图 char g[100][100]; int n,m; ...
分类:其他好文   时间:2020-01-29 15:51:52    阅读次数:43
Highways POJ - 1751
#include<iostream> #include<cstdio> #include<cmath> #include<algorithm> using namespace std; const int maxn=800; int n,m,tot,u,v; int pre[maxn]; //存点 ...
分类:其他好文   时间:2020-01-29 15:48:00    阅读次数:51
挑战程序设计竞赛2.3习题:Making the Grade POJ - 3666
A straight dirt road connects two fields on FJ's farm, but it changes elevation more than FJ would like. His cows do not mind climbing up or down a si ...
分类:其他好文   时间:2020-01-29 15:43:18    阅读次数:94
Constructing Roads POJ - 2421 最小生成树板子题
#include<iostream> #include<cstring> #include<algorithm> using namespace std; const int N=110; int p[N]; struct edge{ int a; int b; int w; }e[N*N]; in ...
分类:其他好文   时间:2020-01-29 14:22:30    阅读次数:62
Building a Space Station POJ - 2031 三维最小生成树,其实就是板子题
#include<iostream> #include<cmath> #include<algorithm> #include<cstdio> using namespace std; const int N=1e5; struct edge{ int a,b; double w; }e[N]; d ...
分类:其他好文   时间:2020-01-29 14:01:16    阅读次数:89
Networking POJ - 1287 最小生成树板子题
#include<iostream> #include<algorithm> using namespace std; const int N=1e5; struct edge{ int a,b,w; }e[N]; bool cmp(edge a,edge b) { return a.w<b.w; ...
分类:Web程序   时间:2020-01-29 12:50:21    阅读次数:89
POJ 2387 Til the Cows Come Home
#include<iostream> #include<cstring> #include<queue> using namespace std; const int N=1e6; int h[N],e[N],ne[N],w[N]; int n,m; int idx; bool st[N]; int ...
分类:其他好文   时间:2020-01-29 12:27:30    阅读次数:53
昂贵的聘礼 POJ - 1062
#include<iostream> #include<queue> #include<cstring> using namespace std; const int N=1e6+10,INF=0x3f3f3f3f; int h[N],ne[N],e[N],w[N],idx; int dist[N] ...
分类:其他好文   时间:2020-01-29 12:26:00    阅读次数:52
20310条   上一页 1 ... 39 40 41 42 43 ... 2031 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!