DP
文章平均质量分 72
_Magic
停更,恢复时间未知
展开
-
Pearls poj1260 (DP)
PearlsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8972 Accepted: 4496DescriptionIn Pearlania everybody is fond of pearls. One company, called The Ro原创 2016-11-24 19:13:48 · 392 阅读 · 0 评论 -
Balance poj1837 (DP & 01背包)
BalanceTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 14005 Accepted: 8804DescriptionGigel has a strange "balance" and he wants to poise it. Actually,原创 2017-02-07 08:55:28 · 412 阅读 · 0 评论 -
最长上升子序列 最长公共子序列 最长公共子串 数字三角形 等简单DP以及变形
最长公共子序列问题#include #include using namespace std;short dp[510][510];int n;int FinMaxLen(char s[],char p[]){ memset(dp,0,sizeof(dp)); int i,j; int sk=strlen(s),pk=strlen(p);原创 2017-02-07 17:11:27 · 381 阅读 · 0 评论 -
L2-008. 最长对称子串 (最长公共子串简单应用)
L2-008. 最长对称子串时间限制 100 ms内存限制 65536 kB代码长度限制 8000 B判题程序 Standard 作者 陈越对给定的字符串,本题要求你输出最长对称子串的长度。例如,给定"Is PAT&TAP symmetric?",最长对称子串为"s PAT&TAP s",于是你原创 2017-03-17 11:35:21 · 909 阅读 · 0 评论 -
Check the difficulty of problems (概率DP)poj2151
Check the difficulty of problemsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7104 Accepted: 3078DescriptionOrganizing a programming contest is not an原创 2017-07-31 17:16:58 · 446 阅读 · 0 评论