dp
十二分热爱
这个作者很懒,什么都没留下…
展开
-
Big Event in HDU(0-1背包,完全背包)
Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Software College in 2002. T...原创 2018-08-12 10:53:43 · 175 阅读 · 0 评论 -
最大连续子序列和/最长不下降子序列/最长公共子序列/最长回文子串
//最大连续子序列和#include<bits/stdc++.h>using namespace std;typedef long long ll;const int maxn = 10010;int A[maxn],dp[maxn];int main(){ int n; cin>>n; for(int i = 1 ; i <= ...原创 2018-11-10 11:12:42 · 253 阅读 · 0 评论 -
Super Jumping! Jumping! Jumping! (非连续递增序列求和)
Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now. The game ...原创 2018-11-10 12:28:37 · 1332 阅读 · 0 评论