【練習09】簡單動態規劃 1003 Super Jumping! Jumping! Jumping!

演算法思路：動態規劃 

狀態轉移方程：d[i] = d[j] + a[i] ; j < i。分別嘗試所有的j（j < i), 在內層迴圈中動態更新d[i], 同時在內層的迴圈結束之後用d[i]更新max_score。

//模板開始#include <string>   #include <vector>   #include <algorithm>   #include <iostream>   #include <sstream>   #include <fstream>   #include <map>   #include <set>   #include <cstdio>   #include <cmath>   #include <cstdlib>   #include <ctime>#include<iomanip>#include<string.h>#define SZ(x) (int(x.size()))using namespace std;int toInt(string s){istringstream sin(s); int t; sin>>t; return t;}template<class T> string toString(T x){ostringstream sout; sout<<x; return sout.str();}typedef long long int64;int64 toInt64(string s){istringstream sin(s); int64 t; sin>>t;return t;}template<class T> T gcd(T a, T b){ if(a<0) return gcd(-a, b);if(b<0) return gcd(a, -b);return (b == 0)? a : gcd(b, a % b);}//模板結束（通用部分）#define ifs cin#define MAX_LEN 1005int a[MAX_LEN];int d[MAX_LEN];int n;int max_score;void dp(){max_score = d[1];for(int i = 2; i <= n; i++){for(int j = 1; j < i; j++){if(a[j] < a[i] && d[i] < d[j] + a[i]){d[i] = d[j] + a[i];}if(max_score < d[i]){max_score = d[i];}}}}//【練習09】簡單動態規劃 1003 Super Jumping! Jumping! Jumping!int main(){//ifstream ifs("shuju.txt", ios::in);while(ifs>>n && n != 0){memset(d, -1, sizeof(d));memset(a, 0, sizeof(a));for(int i = 1 ; i <= n; i++){ifs>>a[i];d[i] = a[i];}dp();cout<<max_score<<endl;}return 0;}