DP
文章平均质量分 81
xinwen1995
这个作者很懒,什么都没留下…
展开
-
DP之数塔
#include #include #include using namespace std;//G++提交时WA,C++可以AC 第一次做dp的题目,主要是状态转移方程int main(){ int T,i,j; int n; int a[101][101],dp[101][101]; scanf("%d",&T); while(T-原创 2015-06-23 21:58:34 · 451 阅读 · 0 评论 -
HDU 2151 WORM (动态规划 或 递归)
递归肯定是超时的 不过我还没接触过dpWormTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3437 Accepted Submission(s): 2217Problem Description原创 2015-12-04 17:01:24 · 319 阅读 · 0 评论 -
HDU 1028 (dp)
动态规划原创 2016-02-05 14:17:34 · 379 阅读 · 0 评论 -
HDU 1520 Anniversary party (树状DP)
Anniversary partyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7701 Accepted Submission(s): 3375Problem DescriptionThere is原创 2016-02-01 22:42:45 · 314 阅读 · 0 评论 -
数位DP
http://blog.csdn.net/niuox/article/details/9864199原创 2016-05-03 15:22:12 · 283 阅读 · 0 评论 -
Codeforces Round #346 (Div. 2)
A. Round House#include #include #include #include #include #include #include #include #include #include #include #include #include #define inf (1<<28)#define mod 1000000007#define MAX原创 2016-06-15 12:28:23 · 450 阅读 · 0 评论 -
Codeforces Round #358 (Div. 2)
682A - Alyona and Numbers#include #define met(a,b) memset(a,b,sizeof(a))#define inf (1<<28)#define mod 1000000007#define MAXN 100000 + 10#define MAXM 100000using namespace std;typedef lon原创 2016-06-20 17:06:18 · 317 阅读 · 0 评论