2000提高3

#include<iostream>

using namespace std;

int a[11][11],b[11][11],i,j,k,n,d[3],zhi;

int main()

{cin>>n;

cin>>d[0]>>d[1]>>d[2];

do

{a[d[0]][d[1]]=d[2];

cin>>d[0]>>d[1]>>d[2];

}while(i<n&&d[0]+d[1]+d[2]!=0);

for(i=1;i<=n;i++)

for(j=1;j<=n;j++)

{if(b[i-1][j]>b[i][j-1])

b[i][j]=a[i][j]+b[i-1][j];

else

b[i][j]=a[i][j]+b[i][j-1];

}

zhi=b[n][n];

while(i>=1&&j>=1)

{if(b[i-1][j]>b[i][j-1])

{a[i-1][j]=0;i--;}

else

{a[i][j-1]=0;j--;}

if(i==1)

{for(k=j;k>=1;k--)

a[i][k]=0;

break;

}

if(j==1)

{for(k=i;k>=1;k--)

a[k][j]=0;

break;

}

}

for(i=1;i<=n;i++)

for(j=1;j<=n;j++)

b[i][j]=0;

for(i=1;i<=n;i++)

for(j=1;j<=n;j++)

{if(b[i-1][j]>b[i][j-1])

b[i][j]=a[i][j]+b[i-1][j];

else

b[i][j]=a[i][j]+b[i][j-1];

}

zhi+=b[n][n];

cout<<zhi;

//system("pause");

return 0;

}