PTA 1045【DP】

【PTA 1045【DP】】的更多相关文章

思路: DP[ i ] 代表以值 i 结尾的当前最长长度. 每次枚举序列数组,dp[ i ] = max( dp[ i ] ,dp[ a[j] ] + 1); #include <bits/stdc++.h> using namespace std; typedef long long LL; const int N=2e2+10; int n,m; int a[N],id[N]; int dp[N],x; int main() { int t; scanf("%d",&a…

Kattis - honey【DP】

Kattis - honey[DP] 题意有一只蜜蜂,在它的蜂房当中,蜂房是正六边形的,然后它要出去,但是它只能走N步,第N步的时候要回到起点,给出N, 求方案总数思路用DP 因为N == 14 所以最多走7步我们不妨设 (7, 7) 为原点,然后 dp[0][7][7] = 1 因为 N == 0 的时候方案数只有一个那就是不动吧.. dp[i][j][k] i 代表第几步 j k 分别表示目前的位置一个点在一张图里面本来有八个方向可以走这里六边形我们只取六个方向就可…

HDOJ 1423 Greatest Common Increasing Subsequence 【DP】【最长公共上升子序列】

HDOJ 1423 Greatest Common Increasing Subsequence [DP][最长公共上升子序列] Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8768 Accepted Submission(s): 2831 Problem Description This is a problem from ZOJ 24…

HDOJ 1501 Zipper 【DP】【DFS+剪枝】

HDOJ 1501 Zipper [DP][DFS+剪枝] Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10886 Accepted Submission(s): 3925 Problem Description Given three strings, you are to determine whether the third str…

HDOJ 1257 最少拦截系统【DP】

HDOJ 1257 最少拦截系统 [DP] Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 50753 Accepted Submission(s): 19895 Problem Description 某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹…

HDOJ 1159 Common Subsequence【DP】

HDOJ 1159 Common Subsequence[DP] Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 44280 Accepted Submission(s): 20431 Problem Description A subsequence of a given sequence is the given sequence wit…

HDOJ_1087_Super Jumping! Jumping! Jumping! 【DP】

HDOJ_1087_Super Jumping! Jumping! Jumping! [DP] Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 44670 Accepted Submission(s): 20693 Problem Description Nowadays, a kind of chess game called "Super…