ACM
Felix2048
这个作者很懒,什么都没留下…
展开
-
ACM - Bone Collector (HDU 2602)
动态规划解决01背包问题原创 2018-12-14 10:27:01 · 155 阅读 · 0 评论 -
ACM - Common Subsequence (HDU 1159)
Common Subsequence #include <iostream> #include <string> #include <algorithm> #define MAX 1010 using namespace std; int dp[MAX][MAX]; string strA, strB; void init() { int len = ...原创 2018-12-18 08:40:12 · 180 阅读 · 0 评论 -
ACM - Longest Ordered Subsequence (POJ 2533)
Longest Ordered Subsequence #include <iostream> #include <algorithm> #define MAX 1010 using namespace std; int n, arr[MAX], dp[MAX]; // dp[i]: the longest ordered subsequence of the fir...原创 2018-12-18 09:10:42 · 197 阅读 · 0 评论