最簡單的DP,于是只用了一維數(shù)組稍微提高下難度,不過還是一次編譯一次提交成功了,恩

/**//*
PROG: numtri
ID: 06301031
LANG: C++
*/

#include <iostream>
#include <fstream>

using namespace std;


int main()
{
ifstream fin("numtri.in");
ofstream fout("numtri.out");
int n;
fin >> n;
int i, j;
int f[1001];

for (i = 0; i <= n; i++)
{
f[i] = 0;
}

for (i = 0; i < n; i++)
{

for (j = 0; j <= i; j++)
{
int x;
fin >> x;
f[j] += x;
}
int temp[1001];

for (j = 0; j <= i; j++)
{
temp[j] = f[j];
}
temp[i + 1] = f[i];

for (j = 0; j <= i; j++)
{

if (f[j] > temp[j + 1])
{
temp[j + 1] = f[j];
}
}

for (j = 0; j <= i + 1; j++)
{
f[j] = temp[j];
}
}

int max = 0;

for (i = 0; i <= n; i++)
{

if (f[i] > max)
{
max = f[i];
}
}
fout << max << endl;
return 0;
}







































































