ZJU 1642 Match for Bonus
2009-04-30 19:20
387 查看
分析:好邪恶的一题,是典型的LCS变形,数据规模没有给出,但却很大。直接开2维会超空间,要用滚动数组。
#include <iostream>
using namespace std;
#define MAXLEN 10001
int dp[2][MAXLEN];
int values[26];
int main()
#include <iostream>
using namespace std;
#define MAXLEN 10001
int dp[2][MAXLEN];
int values[26];
int main()
相关文章推荐
- zoj1642 Match for Bonus(DP)
- zoj 1642 - Match for Bonus
- zoj 1642 Match for Bonus
- zoj1642——Match for Bonus
- ZOJ 1642 Match for Bonus(LCS)
- zoj 1642 Match for Bonus(动态规划)
- 子串数据ZOJ 1642 Match for Bonus
- ZOJ 1642 Match for Bonus
- ZOJ 1642 Match for Bonus(dp)
- zoj 1642 Match for Bonus[dp,lcs]
- ZOJ 1642 Match for Bonus (DP)
- ZOJ 1642 Match for Bonus
- zoj 1642 Match for Bonus
- ZOJ 1642 Match for Bonus
- ZOJ 1642 Match for Bonus
- Match for Bonus
- zju2012:Hello World for U
- 请关闭 "use auto layout" for your nibs if you want to match ios < 6
- default' is not a best match for any device/locale combination.
- error LNK2038: mismatch detected for '_MSC_VER': value '1600' doesn't match value '1700'