poj1163

简单题

View Code

   
     

    
      #include 
    
      <
    
      iostream
    
      >
    
      
#include 
    
      <
    
      cstdio
    
      >
    
      
#include 
    
      <
    
      cstdlib
    
      >
    
      
#include 
    
      <
    
      cstring
    
      >
    
      

    
      using
    
       
    
      namespace
    
       std;


    
      #define
    
       maxn 105
    
      


    
      int
    
       sum[maxn][maxn], a[maxn][maxn];


    
      int
    
       main()
{
 
    
      //
    
      freopen("t.txt", "r", stdin);
    
      

    
       
    
      int
    
       n;
 scanf(
    
      "
    
      %d
    
      "
    
      , 
    
      &
    
      n);
 
    
      for
    
       (
    
      int
    
       i 
    
      =
    
       
    
      1
    
      ; i 
    
      <=
    
       n; i
    
      ++
    
      )
 
    
      for
    
       (
    
      int
    
       j 
    
      =
    
       
    
      1
    
      ; j 
    
      <=
    
       i; j
    
      ++
    
      )
 scanf(
    
      "
    
      %d
    
      "
    
      , 
    
      &
    
      a[i][j]);
 memset(sum, 
    
      0
    
      , 
    
      sizeof
    
      (sum));
 
    
      int
    
       ans 
    
      =
    
       
    
      0
    
      ;
 
    
      for
    
       (
    
      int
    
       i 
    
      =
    
       
    
      1
    
      ; i 
    
      <=
    
       n; i
    
      ++
    
      )
 
    
      for
    
       (
    
      int
    
       j 
    
      =
    
       
    
      1
    
      ; j 
    
      <=
    
       i; j
    
      ++
    
      )
 {
 sum[i][j] 
    
      =
    
       max(sum[i 
    
      -
    
       
    
      1
    
      ][j 
    
      -
    
       
    
      1
    
      ], sum[i 
    
      -
    
       
    
      1
    
      ][j]) 
    
      +
    
       a[i][j];
 ans 
    
      =
    
       max(ans, sum[i][j]);
 }
 printf(
    
      "
    
      %d\n
    
      "
    
      , ans);
 
    
      return
    
       
    
      0
    
      ;
}