DP入门之一 金字塔

//这个我本想定义一个结构的，但定义一个新的结构对于这一个太麻烦了，就用了三个数组来简化

#include<iostream>
#include<fstream>
#include<cstdlib>
using namespace std;


ifstream fin("C:\\data12.in");


int data[32767];
int prev[32676];
int maxsum[32767];
int n;


void Init()
{
fin>>n;
int m=n*(n+1)/2;
for(int i=0;i<m;++i)
fin>>data[i];
}


void DP()
{
prev[0]=0;
maxsum[0]=data[0];
for(int nline=2;nline<=n;++nline)
{
for(int pos=1;pos<=nline;++pos)
{
int location=(nline-1)*nline/2+pos-1;
if(pos==1)
{
prev[location]=(nline-2)*(nline-1)/2;
maxsum[location]=data[location]+maxsum[(nline-2)*(nline-1)/2];
}
else if(pos==nline)
{
prev[location]=(nline-1)*nline/2-1;
maxsum[location]=data[location]+maxsum[(nline-1)*nline/2-1];
}
else
{
int leftprev,rightprev;
int leftsum,rightsum;
leftprev=(nline-2)*(nline-1)/2+pos-2;
rightprev=(nline-2)*(nline-1)/2+pos-1;
leftsum=data[location]+maxsum[leftprev];
rightsum=data[location]+maxsum[rightprev];
if(leftsum>=rightsum)
{
prev[location]=leftprev;
maxsum[location]=leftsum;
}
else
{
prev[location]=rightprev;
maxsum[location]=rightsum;
}
}
}
}
}


void print()
{
int max=0;
int pos;
for(int i=(n-1)*n/2;i<=n*(n+1)/2-1;++i)
{
if(maxsum[i]>max)
{
max=maxsum[i];
pos=i;
}
}
while(pos>0)
{
cout<<data[pos]<<"\t";
pos=prev[pos];
}
cout<<data[0]<<endl;
}


int main()
{
Init();
DP();
print();
system("pause");
return 0;
}