usaco Number Triangles DP-白红宇

usaco Number Triangles DP

阅读量：6435 次

发布时间：2019-06-23

本文共 1316 字，大约阅读时间需要 4 分钟。

DP入门题。

//#pragma comment(linker, "/STACK:1024000000,1024000000")#include
      
       #include
       
        #include
        
         #include
         
          #include
          
           #include
           
            #include
            
             #include
             
              #include
              
               #include
               #include
                
                 #include
                 
                  #include
                  
                   #include
                   
                    using namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair
                    
                      pii;#define pb(a) push(a)#define INF 0x1f1f1f1f#define lson idx<<1,l,mid#define rson idx<<1|1,mid+1,r#define PI 3.1415926535898template
                     
                       T min(const T& a,const T& b,const T& c) { return min(min(a,b),min(a,c));}template
                      
                        T max(const T& a,const T& b,const T& c) { return max(max(a,b),max(a,c));}void debug() {#ifdef ONLINE_JUDGE#else freopen("d:\\in1.txt","r",stdin); freopen("d:\\out1.txt","w",stdout);#endif}int getch() { int ch; while((ch=getchar())!=EOF) { if(ch!=' '&&ch!='\n')return ch; } return EOF;}const int maxn=1005;int da[maxn][maxn];int main(){ freopen("numtri.in","r",stdin); freopen("numtri.out","w",stdout); int n; scanf("%d",&n); for(int i=1;i<=n;i++) { for(int j=1;j<=i;j++) scanf("%d",&da[i][j]); } for(int i=n-1;i>=1;i--) { for(int j=1;j<=i;j++) da[i][j]=max(da[i+1][j],da[i+1][j+1])+da[i][j]; } printf("%d\n",da[1][1]); return 0;}