随笔分类 -  dp 基本

Codeforces Round #369 (Div. 2) C 基本dp+暴力
摘要：C. Coloring Trees time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Coloring Trees time 阅读全文
posted @ 2016-08-31 16:28 快点说我帅 阅读(272) 评论(0) 推荐(0)
CDOJ 1133 菲波拉契数制 变直接统计为构造
摘要：菲波拉契数制 菲波拉契数制 Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others) Submit Status 我们定义如下数列为菲波拉契数列： F(1)=1F(1)=1 F(2)=2F(2)=2 阅读全文
posted @ 2016-08-10 20:18 快点说我帅 阅读(351) 评论(0) 推荐(0)
hdu 5791 Two 二维dp
摘要：Two Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 889 Accepted Submission(s): 405 Problem Descr 阅读全文
posted @ 2016-08-03 12:01 快点说我帅 阅读(245) 评论(0) 推荐(1)
hdu 5532 Almost Sorted Array nlogn 的最长非严格单调子序列
摘要：Almost Sorted Array Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2504 Accepted Submission(s) 阅读全文
posted @ 2016-08-01 23:16 快点说我帅 阅读(516) 评论(0) 推荐(0)
TTTTTTTTTTTTTT hdu 5763 Another Meaning 哈希+dp
摘要：Another Meaning Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 917 Accepted Submission(s): 434 P 阅读全文
posted @ 2016-07-30 20:44 快点说我帅 阅读(599) 评论(2) 推荐(0)
hdu 5773 最长递增子序列 （nlogn）+贪心
摘要：The All-purpose Zero Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 947 Accepted Submission(s): 阅读全文
posted @ 2016-07-29 16:27 快点说我帅 阅读(204) 评论(0) 推荐(0)
dp
摘要：Dexter considers a permutation of first N natural numbers good if it doesn’t have x and x+1 appearingconsecutively, where (1 ≤ x < N). For example, for 阅读全文
posted @ 2016-07-22 19:01 快点说我帅 阅读(312) 评论(0) 推荐(0)
CF #355div2 D 宝藏与钥匙 dp 二维数组智商题
摘要：D. Vanya and Treasure time limit per test 1.5 seconds time limit per test memory limit per test 256 megabytes memory limit per test input standard inp 阅读全文
posted @ 2016-06-04 17:10 快点说我帅 阅读(297) 评论(0) 推荐(0)
dp周训练 状态压缩
摘要：题目链接：题意：给你一个10*10的矩阵，每到一个格子中都要拿一个0-9的数值，求从矩阵左上方走到右下方且必须0-9都经过，拿的数值和最小是多少； 本来一血的，犯了个傻逼错误；看wa代码； 犯错原因：初始化时对每个格子都dp[i][j][1<<v]=v;没道理啊，，题目都说了必须从左上角开始走 阅读全文
posted @ 2016-04-11 21:16 快点说我帅 阅读(125) 评论(0) 推荐(0)
hdu 1081 dp问题：最大子矩阵和
摘要：题目链接 题意：给你一个n*n矩阵，求这个矩阵的最大子矩阵和 #include<iostream> #include<cstdio> #include<string.h> using namespace std; #define inf -0x3f3f3f3f int field[105][105] 阅读全文
posted @ 2016-02-29 14:47 快点说我帅 阅读(142) 评论(0) 推荐(0)