51nod 1083 矩阵取数问题

#include <bits/stdc++.h>using namespace std;long long dp[550][550];int main(){long long n,i,j;while(cin>>n){memset(dp,0,sizeof(dp));for(i=1;i<=n;i++){for(j=1;j<=n;j++){scanf("%lld",&dp[i][j]);dp[i][j]+=max(dp[i-1][j],dp[i][j-1]);}}printf("%lld\n",dp[n][n]);}}