POJ
关注
分享
扫一扫
浙右华亭
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
[POJ-3414]Pots
#include#include#include#include#include#include#include#include#includeusing namespace std;const int maxn = 100 + 12;struct Node { int a, b; int t; int s, f; Node(int aa,原创 2017-09-01 16:48:25 · 302 阅读 · 0 评论 -
[POJ-2236] The Suspects
#include#include#include#include#include#include#include#include#includeusing namespace std;const int maxn = 30000 + 20;int parent[maxn];int member[maxn];int GetParent(int a) { i原创 2017-09-29 15:27:09 · 265 阅读 · 0 评论 -
[POJ-2236] Wireless Network
#include#include#include#include#include#includeusing namespace std;const int maxn = 1001 + 20;int parent[maxn];bool open[maxn];struct Node{ int x; int y; Node(int xx, int yy原创 2017-09-22 16:43:34 · 291 阅读 · 0 评论 -
[openjudge]百练2755 神奇的口袋
递归算法#include#include#include#includeusing namespace std;int a[30]; int N;int Ways( int w, int k ) { if( w==0 ) { return 1; } if( k<=0 ) { return 0; } return Ways(w, k-1) + Ways转载 2017-10-20 14:37:22 · 422 阅读 · 0 评论 -
[POJ 3624]Charm Bracelet
#include#include#includeusing namespace std;const int maxn = 3402+20;const int maxm = 12880+20;int W[maxn]; // weightint D[maxn]; // desirabilityint f[2][maxm];int main() {原创 2017-11-17 15:47:33 · 274 阅读 · 0 评论 -
[POJ-2387]Til the Cows Come Home
从V到1可以，从1到V会WA，原因分析中#include#include#include#include#include#include#includeusing namespace std;const int MAX_V = 1000 + 5;const int INF = 0xffffff;struct edge{ int to, cost;原创 2017-12-20 16:23:54 · 242 阅读 · 0 评论