ACM_POJ
zytjyh
努力,也是一种天赋
展开
-
POJ 3345(树形dp)
wa#pragma warning(disable:4996) #include<cstdio> #include<cstring> #include<cmath> #include<vector> #include<algorithm> #include<iostream> #include<map> using namespace std;const int INF=0x3f3f3f3f; in原创 2016-08-16 10:37:53 · 420 阅读 · 0 评论 -
POJ 1185(状态压缩dp)
#include <iostream> #include <cstring> #include <cstdio> #include <cmath> #include<algorithm> using namespace std;int dp[105][65][65]; //d[i][j][k]: “第i行状态是s[j],第i-1行状态是s[k]”的 int s[105]; //一行的状态选原创 2016-08-11 22:37:36 · 429 阅读 · 0 评论 -
POJ 3254(状态压缩dp)
#include<cstdio> #include<cstring> #include<algorithm> #include<iostream> using namespace std;#define MOD 100000000; int n, m; int map[20]; int dp[20][1 << 12]; int state[1 << 12]; int S=0; bool OneNea原创 2016-08-11 16:43:02 · 406 阅读 · 0 评论 -
POJ2955(区间dp)详解
#include <iostream> #include <string.h> #include <stdlib.h> #include <algorithm> #include <math.h> using namespace std;char str[105]; int dp[105][105];int main() { while(cin>>str+1) { i原创 2016-08-08 21:26:50 · 370 阅读 · 0 评论 -
POJ 3311 (状态压缩dp)
这题是 的升级样例数据的图解 求完后数组值 dis为两点之间最短距离,用floyd算法求 dp[i][j]为状态i下以j结尾的最短路径#include <iostream> #include <cstring> #include<string> #include <cstdio> #include <cmath> #include<algorithm> using namespace原创 2016-08-13 13:52:04 · 566 阅读 · 1 评论 -
POJ 2288(状态压缩dp)
正在写这里写代码片原创 2016-08-13 14:18:10 · 370 阅读 · 0 评论 -
POJ(2739)
#pragma warning(disable:4996) #include<cstdio> #include<cstring> #include<string> #include<cmath> #include<vector> #include<algorithm> #include<iostream> #include<time.h> using namespace std;int Count;原创 2016-09-05 00:38:22 · 414 阅读 · 0 评论 -
POJ(2299)
#pragma warning(disable:4996) #include<cstdio> #include<cstring> #include<string> #include<cmath> #include<vector> #include<algorithm> #include<iostream> #include<time.h> using namespace std;const int原创 2016-09-07 20:17:16 · 347 阅读 · 0 评论 -
POJ(2388)
#pragma warning(disable:4996) #include<cstdio> #include<cstring> #include<string> #include<cmath> #include<vector> #include<algorithm> #include<iostream> #include<time.h> using namespace std;const int原创 2016-09-07 20:27:44 · 213 阅读 · 0 评论 -
POJ 1042(贪心)
wa#pragma warning(disable:4996) #include<cstdio> #include<cstring> #include<string> #include<cmath> #include<vector> #include<algorithm> #include<iostream> #include<time.h> using namespace std;const in原创 2016-08-21 20:37:00 · 392 阅读 · 0 评论 -
POJ 2437(贪心)
#include<cstdio> #include<cstring> #include<string> #include<cmath> #include<vector> #include<algorithm> #include<iostream> #include<time.h> using namespace std;const int INF = 0x3f3f3f3f;struct node {原创 2016-08-21 19:26:18 · 282 阅读 · 0 评论 -
POJ 3342(树形dp)
wa#pragma warning(disable:4996) #include<cstdio> #include<cstring> #include<string> #include<cmath> #include<vector> #include<algorithm> #include<iostream>using namespace std; const int INF = 0x3f3f3f3原创 2016-08-17 10:11:25 · 371 阅读 · 0 评论 -
POJ 2096 (概率dp)
#pragma warning(disable:4996) #include<cstdio> #include<cstring> #include<string> #include<cmath> #include<vector> #include<algorithm> #include<iostream>using namespace std; const int INF = 0x3f3f3f3f;原创 2016-08-17 14:42:55 · 298 阅读 · 0 评论 -
POJ 3744(矩阵概率dp)
#pragma warning(disable:4996) #include<cstdio> #include<cstring> #include<string> #include<cmath> #include<vector> #include<algorithm> #include<iostream> #include<time.h> using namespace std;struct Mat原创 2016-08-17 15:52:44 · 360 阅读 · 0 评论 -
POJ 2549(中间相遇)
#pragma warning(disable:4996) #include<cstdio> #include<cstring> #include<string> #include<cmath> #include<vector> #include<algorithm> #include<iostream> #include<time.h> using namespace std; const int原创 2016-08-17 22:20:14 · 332 阅读 · 0 评论 -
POJ 1017(贪心)
#include<cstdio> #include<cstring> #include<string> #include<cmath> #include<vector> #include<algorithm> #include<iostream> #include<time.h> using namespace std;int main() { int value[7]; int k原创 2016-08-20 16:21:27 · 299 阅读 · 0 评论 -
POJ 2231(贪心)
#include<cstdio> #include<cstring> #include<string> #include<cmath> #include<vector> #include<algorithm> #include<iostream> #include<time.h> using namespace std;const int INF = 0x3f3f3f3f;int position[原创 2016-08-20 17:49:31 · 261 阅读 · 0 评论 -
HDU 1338 POJ 1323(贪心)
#include<cstdio> #include<cstring> #include<string> #include<cmath> #include<vector> #include<algorithm> #include<iostream> #include<time.h> using namespace std;bool f[1005]; int a[1005];int vs_main()原创 2016-08-20 20:25:54 · 456 阅读 · 1 评论 -
POJ 1456 (贪心)
#include<cstdio> #include<cstring> #include<string> #include<cmath> #include<vector> #include<algorithm> #include<iostream> #include<time.h> using namespace std;struct node { int pi; int di; }p原创 2016-08-21 10:00:58 · 220 阅读 · 0 评论 -
POJ 1328(贪心)
#include<cstdio> #include<cstring> #include<string> #include<cmath> #include<vector> #include<algorithm> #include<iostream> #include<time.h> using namespace std;struct point { double left, right; }原创 2016-08-21 11:12:11 · 300 阅读 · 0 评论 -
POJ(2503)(两种方法,二分,Map)
#pragma warning(disable:4996) #include<cstdio> #include<cstring> #include<string> #include<cmath> #include<vector> #include<algorithm> #include<iostream> #include<time.h> using namespace std;const int原创 2016-09-07 21:58:30 · 403 阅读 · 0 评论