Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
代码!#include <stdio.h> #define M 100+10 #define max(a,b) a>b?a:b int dp[M][M]; int main() { int n,i,j; scanf("%d",&n); for(i=1;i<=n;i++) { getchar(); for(j=1;j<=i;j++) scanf("%d",&dp[i][j]); } for(i=n-1;i>=1;i--) { for(j=1;j<=i;j++) dp[i][j]+=max(dp[i+1][j],dp[i+1][j+1]); } printf("%d\n",dp[1][1]); return 1; } Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator