DP
ccshijtgc
这个作者很懒,什么都没留下…
展开
-
poj 2411 Mondriaan's Dream(状压dp)
Mondriaan's Dream#include <iostream>#include <cstring>#include <cstdio>#include <cstdlib>using namespace std;int N, M;//棋盘的宽和长long long dp[15][4096];////dp[i][j]用于存储填...原创 2018-10-24 13:55:24 · 134 阅读 · 0 评论 -
HDU 2412 Party at Hali-Bula(树形DP)
Party at Hali-Bula#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <vector>#include <algorithm>#include <map>using names原创 2018-07-14 10:10:27 · 135 阅读 · 0 评论 -
POJ 2342 Anniversary party(树形DP)
Anniversary party#include <iostream>#include <cstdio>#include <cstring>#include <stack>#include <queue>#include <map>#include <set>#include <vec原创 2018-07-13 16:00:48 · 109 阅读 · 0 评论 -
HDU 1257 最少拦截系统(LIS)
最少拦截系统#include <stdio.h>#include <string.h>#include <iostream>using namespace std;const int maxn = 30000+5;int n;int nums[maxn];int dp[maxn];//以第i个元素结尾的最长递增子序列 i从1算起int ans...原创 2018-07-07 10:52:53 · 131 阅读 · 0 评论 -
POJ 1651 Multiplication Puzzle(区间DP)
Multiplication Puzzle#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int n,a[105],dp[105][105], i, j, k, l;int main(){ //freopen("data.in", "r...原创 2018-07-13 12:23:09 · 125 阅读 · 0 评论 -
POJ 3186 Treats for the Cows(DP)
Treats for the Cows#include<iostream>#include<cstring>#include<cmath>#include<cstdio>#include<cstdlib>#include<algorithm>using namespace std;const int N = ...原创 2018-07-13 11:39:05 · 108 阅读 · 0 评论 -
POJ 3056 The Bavarian Beer Party(区间DP)
The Bavarian Beer Party#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<vector>#include<algorithm>using namespace std;const int ma...原创 2018-07-13 10:40:23 · 151 阅读 · 0 评论 -
POJ 2127 Greatest Common Increasing Subsequence(LCIS)
Greatest Common Increasing Subsequence#include <stdio.h>#include <string.h>#define MAX 501typedef struct path { int x, y;} Pre;int seq1[MAX], seq2[MAX];int len1, len2;int dp[M...原创 2018-07-06 16:33:12 · 140 阅读 · 0 评论 -
HDU 4632 Palindrome subsequence(区间DP)
Palindrome subsequence#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<vector>#include<algorithm>using namespace std;const int max...原创 2018-07-13 09:05:32 · 87 阅读 · 0 评论 -
HDU 4283 You Are the One(区间DP)
You Are the One#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<vector>#include<algorithm>#define inf 1<<27using namespace s原创 2018-07-12 13:14:02 · 174 阅读 · 0 评论 -
HDU 1423 Greatest Common Increasing Subsequence(LICS)
最长上升公共子序列#include <stdio.h>#include <algorithm>#include <string.h>using namespace std;int n, m, a[505], b[505];int dp[505][505];//以a[i]结尾的最长公共上升子序列长度int LICS() { int MAX...原创 2018-07-05 17:56:10 · 96 阅读 · 0 评论 -
HDU 2196 computer(树形DP)
//HDU2196 求树中每个点能达到的最大距离,结合解题报告看#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int MAXN = 10000+200;struct edge { int to;//终端点 int next;...原创 2018-07-23 16:54:13 · 140 阅读 · 0 评论 -
POJ 3280 Cheapest Palindrome(区间dp)
Cheapest Palindrome#include <cstdio>#include <cstring>#include <cmath>#include <iostream>#include <algorithm>using namespace std;const int maxn = 2000+5;int dp[ma...原创 2018-07-11 22:28:46 · 96 阅读 · 0 评论 -
HDU 1503 Advanced Fruits(LCS)
Advanced Fruits#include <iostream>#include <string>#include <cstring>#include <cstdio>#include <cstdlib>#include <algorithm>#include <vector>using nam原创 2018-07-05 11:56:59 · 116 阅读 · 0 评论 -
POJ 2533 Longest Ordered Subsequence(LIS)
Longest Ordered Subsequence#include <cstdlib>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn = 1000+5;int num[maxn];int dp[m...原创 2018-07-05 11:23:07 · 100 阅读 · 0 评论 -
HDU1054 && POJ1463:Strategic game(树形DP)
Strategic game#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int dp[1505][2];int vis[1505], edges[1505];int len,root;struct node { int now, n...原创 2018-07-14 12:51:51 · 108 阅读 · 0 评论 -
HDU 1011 Starship Troopers(树形背包)
Starship Troopers#include <iostream>#include <vector>#include <cstring>#include <cstdio>using namespace std;const int maxn = 110;int n, m;int cos[maxn], weg[maxn];in...原创 2018-07-26 10:23:51 · 163 阅读 · 0 评论 -
HDU1520:Anniversary party(树形DP)
HDU1520:Anniversary party(树形DP)原创 2018-07-26 12:39:31 · 159 阅读 · 0 评论 -
hdu 1074 Doing Homework(状压DP)
Doing Homework#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>#include <cmath>#include <queue>using nam原创 2018-10-10 11:14:15 · 88 阅读 · 0 评论 -
HDU 3920 Clear All of Them I(状态压缩)
https://blog.csdn.net/lxglbk/article/details/6674270#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>using namespace std...转载 2018-10-13 11:07:33 · 135 阅读 · 0 评论 -
HDU 4539 郑厂长系列故事——排兵布阵(状态压缩DP)
郑厂长系列故事——排兵布阵#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <cmath>#define N 110#define M 200using namespace std;int n, m...原创 2018-10-12 11:09:12 · 234 阅读 · 0 评论 -
HDU 4049 Tourism Planning(状态压缩DP)
http://acm.hdu.edu.cn/showproblem.php?pid=4049#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int const INF = 0x3fffffff;int n, m;//dp[i][s]表示经过前...原创 2018-10-12 08:35:55 · 257 阅读 · 0 评论 -
HDU 1565 方格取数(1) (状压DP)
http://acm.hdu.edu.cn/showproblem.php?pid=1565#include <algorithm>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;int dp[25][20000], s[20000], ...原创 2018-10-11 11:47:29 · 149 阅读 · 0 评论 -
HDU 3652 B-number(数位)
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int a[15];//dp[i][j][k]//i:数位//j:余数//k:3种操作状况,0:末尾不是1, 1:末尾是1, 2:含有13int dp[15][15][3];in...原创 2018-09-08 14:39:41 · 138 阅读 · 0 评论 -
数位DP模板
// pos = 当前处理的位置(一般从高位到低位)// pre = 上一个位的数字(更高的那一位)// status = 要达到的状态,如果为1则可以认为找到了答案,到时候用来返回,// 给计数器+1。// limit = 是否受限,也即当前处理这位能否随便取值。如567,当前处理6这位,// 如果前面...转载 2018-08-29 16:41:19 · 121 阅读 · 0 评论 -
HDU 4734 F(x) (数位DP)
F(x)#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>using namespace std;int A, B;//dp[pos][num]: 枚举到当前pos位,后面还需要凑num的权值和的个数//也就是说初始的是时候num是...原创 2018-08-31 15:20:18 · 133 阅读 · 0 评论 -
HDU 3555 Bomb(数位DP)
Bomb#include<iostream>#include<cstdio>#include<cstring>#include<string>using namespace std;typedef long long ll;ll a[100];ll dp[100][3];//dp[pos][st]表示当前第pos位//st=0...原创 2018-08-01 10:12:03 · 116 阅读 · 0 评论 -
HDU 2089 不要62(数位DP)
不要62#include<iostream>#include<cstdio>#include<cstring>#include<string>using namespace std;typedef long long ll;int a[20];int dp[20][2];//dp[pos][sta]表示当前第pos位,前一位是否...原创 2018-07-30 16:58:29 · 150 阅读 · 0 评论 -
POJ 2378(树形DP)
POJ 2378(树形DP)#include <iostream>#include <cstring>#include <cstdio>#include <cstdlib>using namespace std;const int MAX = 50010;struct edge { //建结构体 int next; ...原创 2018-07-30 11:16:40 · 196 阅读 · 0 评论 -
POJ 2486 Apple Tree(树形DP)
Apple Tree(树形DP)#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int M = 210;int wi[M];int dp[M][M][2];//0回来,1不回来int n, m;int len;struct ...原创 2018-07-30 09:23:16 · 191 阅读 · 0 评论 -
POJ 1947 Rebuilding Roads(树形DP)
Rebuilding Roads# include<iostream># include<cstdio># include<cstring># include<vector># include<algorithm>using namespace std;const int N = 155;const int INF = 0...原创 2018-07-16 08:47:06 · 121 阅读 · 0 评论 -
HDU 4003 Find Metal Mineral(树形背包DP)
Find Metal Mineral#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <vector>using namespace std;const int N = 10100;struct N...原创 2018-07-26 14:10:26 · 152 阅读 · 0 评论 -
关于卡特兰数的思考
什么是Catalan数说到Catalan数,就不得不提及Catalan序列,Catalan序列是一个整数序列,其通项公式是我们从中取出的就叫做第n个Catalan数,前几个Catalan数是:1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, 35357670, …咋看...转载 2018-07-05 11:24:59 · 133 阅读 · 0 评论 -
HDU 1130 How Many Trees? HDU 1023 Train Problem II(卡特兰数)
How Many Trees?import java.math.BigInteger;import java.util.Scanner;public class Main { static int n = 0; static void solve(){ BigInteger ans = new BigInteger("1"); for(int ...原创 2018-07-04 16:13:40 · 102 阅读 · 0 评论 -
HDU 2476 String painter(区间DP)
String painter(区间DP)#include <cstdio>#include <cstring>#include <cmath>#include <map>#include <iostream>#include <algorithm>using namespace std;const int max...原创 2018-07-11 12:47:04 · 178 阅读 · 0 评论 -
计蒜客 蒜头君的购物袋2(DP)
蒜头君的购物袋2#include <iostream>#include <cstring>#include <cstdio>#include <cstdlib>#include <algorithm>#define maxn 105#define maxv 1005using namespace std;int dp[...原创 2018-07-03 09:41:16 · 136 阅读 · 0 评论 -
计蒜客 蒜头君的购物袋1(DP)
蒜头君的购物袋1#include <iostream>#include <cstring>#include <cstdio>#include <cstdlib>#define maxn 32#define maxv 20005using namespace std;bool dp[maxn][maxv];int weight[ma...原创 2018-07-03 09:40:01 · 239 阅读 · 0 评论 -
计蒜客 蒜头君的城堡之旅(DP)
蒜头君的城堡之旅#include <iostream>#include <cstring>#include <cstdio>#include <cstdlib>#define maxn 55using namespace std;int n, m;int map[maxn][maxn];int f[maxn][maxn][maxn...原创 2018-07-03 09:00:42 · 214 阅读 · 0 评论 -
计蒜客 蒜头君的新游戏(DP)
蒜头君的新游戏#include <iostream>#include <string>#include <queue>#include <cstring>#include <cstdio>#include <cstdlib>#include <cassert>#include <algo原创 2018-07-03 08:59:06 · 477 阅读 · 0 评论 -
计蒜客 逃生(DP)
逃生#include <iostream>#include <string>#include <queue>#include <cstring>#include <cstdio>#include <cstdlib>#include <cassert>#include <algorithm原创 2018-07-03 08:55:53 · 401 阅读 · 0 评论