tyvj1084数字三角形4

#include<cstdio>
using namespace std;

int max(int x1,int y1)
{
if (x1>y1)
return x1;
else
return y1;
}

int main()
{
int n,i,j,f[26][26],a[26][26],x,y;
scanf("%d",&n);
for (i=1;i<=n;i++)
for (j=1;j<=i;j++)
scanf("%d",&a[i][j]);
scanf("%d %d",&x,&y);
for (i=1;i<=n;i++)
f
[i]=a
[i];
f[x][y]=a[x][y]=a[x][y]+100000;
for (i=n-1;i>=1;i--)
for (j=1;j<=i;j++)
f[i][j]=max(f[i+1][j],f[i+1][j+1])+a[i][j];
printf("%d",f[1][1]-100000);
return 0;
}