1 5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5
30
#include<iostream> using namespace std; int max(int a,int b) { if(a>b) return a; else return b; } int main() { int n,i,j,s,k,a[102][102]; cin>>k; while(k--) { cin>>n; for(i=1;i<=n;i++) for(j=1;j<=i;j++) {cin>>a[i][j];} for(i=n-1;i>0;i--) for(j=1;j<=i;j++) {s=max(a[i+1][j],a[i+1][j+1]); a[i][j]+=s;} cout<<a[1][1]<<endl; } return 0; }
原文:http://blog.csdn.net/rememberautumn/article/details/23531241