f[i][j]:表示第 i 行第 j 列到最后一行的最大权值和; 状态方程: f[i][j]=w[i][j]+max(f[i+1][j],f[i+1][j+1]); // Time 157ms; Memory 1236K #include<iostream> using namespace std; int max(int a,int b) { return a>b?a:b; } int main() { int i,j,n,w[355][...
42. 也能够自顶向下记忆化搜索。。然后状态数组含义都差点儿相同 。。个人觉着搜索比較好写。。。 #include<algorithm>#include<iostream>#include<cstring>#include<cstdlib>#include<string>#include<cctype>#include<vector>#include<cstdio>#include<cmath>#include<queue>#include<stack>#include#include<set>#de...