摘要：
1. 动态规划，f[i,j]=Max{f[i+1,j],f[i+1,j+1]}+a[i,j] (1
#include #include #include #include using namespace std;
long long num[1010][1010];
long max(long a, long b)
{ if (a > b) return a; else return b;
}
int main()
{ ofstream fout ("numtri.out"); ifstream fin ("numtri.in"); ... 阅读全文
