"Algorithm Series learning" [Kuangbin you fly] topic 12 Basic DP1 E-super jumping! jumping! jumping!

Https://vjudge.net/contest/68966#problem/E

http://blog.csdn.net/to_be_better/article/details/50563344

1#include <iostream>2#include <cstdio>3#include <cstring>4#include <string>5#include <algorithm>6#include <cmath>7 #defineINF 0x3f3f3f3f8 using namespacestd;9 intN;Ten Const intmaxn=1e3+Ten; One intA[MAXN]; A intDP[MAXN]; - intMain () - { the      while(SCANF ("%d", &n) = =1&&N) -     { -Memset (DP,0,sizeof(DP)); -          for(intI=1; i<=n;i++) +         { -scanf"%d",&a[i]); +         } A          for(intI=1; i<=n;i++) at         { -             intans=-INF; -              for(intk=0; k<i;k++) -             { -                 if(a[i]>A[k]) -                 { inans=Max (ans,dp[k]); -                 } to             } +dp[i]=ans+A[i]; -         } the         intans=-INF; *          for(intI=0; i<=n;i++) $         {Panax Notoginsengans=Max (ans,dp[i]); -         } theprintf"%d\n", ans); +     } A     return 0; the}

View Code

"Algorithm Series learning" [Kuangbin you fly] topic 12 Basic DP1 E-super jumping! jumping! jumping!