hdu1087 Super Jumping! Jumping! Jumping!
簡單動態規劃,從一串數字中找出最大升序數列的和。
#include<iostream> using namespace std; int a[1005],b[1005]; int main() { int n; while(cin>>n) { if(n==0) break; for(int i=0;i<n;i++) { cin>>a[i]; b[i]=a[i]; for(int j=0;j<i;j++) { if(a[i]>a[j]&&b[j]+a[i]>b[i]) b[i]=b[j]+a[i]; } } int res=0; for(int i=0;i<n;i++) { if(res<b[i]) res=b[i]; } cout<<res<<endl; } }
相關推薦
HDU1087 Super Jumping! Jumping! Jumping! —— DP
amp must mini print mit splay image finally som 題目鏈接:http://acm.split.hdu.edu.cn/showproblem.php?pid=1087 Super Jumping! Jumping! Jumpi
HDU1087 Super Jumping! Jumping! Jumping!【最長遞增子序列】
Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submi
hdu1087 Super Jumping! Jumping! Jumping!
簡單動態規劃,從一串數字中找出最大升序數列的和。 #include<iostream> using namespace std; int a[1005],b[1005]; int main() { int n; while(cin>>
HDU1087 Super Jumping Jumping Jumping DP
Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game,
Super Jumping!Jumping!Jumping!(HDU_1087)(dp求最長上升子序列的和)
inf 自己 長度 int ans out clas urn class 傳送門:HDU_1087 題意:現在要玩一個跳棋類遊戲,有棋盤和棋子。從棋子st開始,跳到棋子en結束。跳動棋子的規則是下一個落腳的棋子的號碼必須要大於當前棋子的號碼。st的號是所有棋子中最小的,en
Super Jumping! Jumping! Jumping! hdu1087(最大遞增子段和)
題目連結 求一個數列的最大遞增子序列和。 注意限制在32位整型範圍內,是可能有負數的。 前i個數字的最大遞增子序列和有兩種情況,加上第i個數字,不加上第i個數字。前者是把i串到之前的某個子段之後一位。 #include<bits/stdc++.h> usi
HDU 1087 Super Jumping! Jumping! Jumping!
blog col som oss score ++ all you finall Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU.
Super Jumping! Jumping! Jumping! HDU - 1087
std idt scribe cas abs roc assume led cor Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU
Super Jumping! Jumping! Jumping!
contain output ini finall player lar cannot tdi pri Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popu
E - Super Jumping! Jumping! Jumping! <HDU 1087>
describe sam test RoCE anti pac end line backward E - Super Jumping! Jumping! Jumping! Nowadays, a kind of chess game called “Super Jumpi
HDU 1087 Super Jumping! Jumping! Jumping
Super Jumping! Jumping! Jumping! Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a
[LIS_最長遞增子序列]-hdu 1087 Super Jumping!
[LIS_最長遞增子序列]-hdu 1087 Super Jumping! 標籤: ACM 題意: Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very
Super Jumping! Jumping! Jumping! (非連續遞增序列求和)
Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this
hdoj1087:Super Jumping! Jumping! Jumping!(dp基礎題-最大上升子序列和(可不連續))
目錄 Super Jumping! Jumping! Jumping! 題目解釋: 解題思路: ac程式碼: Super Jumping! Jumping! Jumping! Time Limit : 2000/1000ms (Java/Other) &nb
HDU-1087-Super Jumping! Jumping! Jumping! (dp)
Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this
HDU-1087-Super Jumping! Jumping! Jumping!(DP+上升子序列)
Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know litt
hdu 1087 Super Jumping!(dp)
思路:動態規劃的三個原則是:1.子問題重疊性2.無後效性3.子結構最優性 如果這題把dp[i]當成前i個數的最長上升子序列的話,那第i+1個數會影響前i個數的選擇,比如 5 6 1 2 3;第i+1個
hdoj 1087 Super Jumping! Jumping! Jumping!
Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 51926 Accep
HDOJ-1087 Super Jumping! Jumping! Jumping!(動態規劃)
連結:HDOJ-1087 Problem Description Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe
hdoj087:Super Jumping! Jumping! Jumping!(dp基礎題-最大上升子序列和(可不連續))
目錄 題目解釋: 解題思路: ac程式碼: Super Jumping! Jumping! Jumping! Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Ot