【文件属性】:
文件名称:ACM PKU 1163 三角问题
文件大小:914B
文件格式:CPP
更新时间:2011-10-24 09:33:10
ACM PKU 1163
关键代码:
int dp(int row,int col,int arrary1[100][100]);
for(i=0;i
b?a:b;
}
int dp(int row,int col,int arrary1[100][100])
{
int n;
if(col==0&&row!=0)
arrary1[row][col]=arrary1[row-1][col]+arrary1[row][col];
else
if(row==col)
arrary1[row][col]=arrary1[row-1][col-1]+arrary1[row][col];
else
arrary1[row][col]=max(arrary1[row-1][col-1],arrary1[row-1][col])+arrary1[row][col];
n=arrary1[row][col];
return n;
}