poj 3262:新数字三角形

动态规划：自底向上

#include<iostream>#include<cmath>using namespace std;int main(){int n,p,q;int a[110][110];while(true){cin>>n;if(n==0)break;for(int i=1;i<=n;i++)for(int j=1;j<=i;j++)cin>>a[i][j];cin>>p>>q;for(int i=n-1;i>=1;i--)for(int j=1;j<=i;j++){a[i][j] = max(a[i][j],a[i+1][j]);a[i][j] = max(a[i][j],a[i+1][j+1]);}cout<<a[p][q]<<endl;}return 0;}