HDOJ 1087 Super Jumping! Jumping! Jumping!
来源:互联网 发布:人口断崖知乎 编辑:程序博客网 时间:2024/04/27 23:40
题意:在n个点中往后移动,有两个条件:(1)只能向后移动,不能向前移动。(2)只能从权值小的节点移动到权值大的节点,求最后累计权值的最大值
链接:http://acm.hdu.edu.cn/showproblem.php?pid=1087
思路:简单的lis类型dp,转移方程dp[i] = max ( dp[i], dp[j] + num[i] )
注意点:无
以下为AC代码:
Run IDSubmit TimeJudge StatusPro.IDExe.TimeExe.MemoryCode Len.LanguageAuthor105037082014-04-08 20:46:50Accepted108731MS232K532 BCluminous11#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <iostream>#include <cstring>#include <cstdio>#include <string>#include <vector>#include <deque>#include <list>#include <map>#include <set>#include <queue>#include <stack>#include <cmath>#include <ctime>#include <cctype>#include <climits>#include <iomanip>#include <cstdlib>#include <algorithm>//#include <unordered_map>//#include <unordered_set>#define ll long long#define ull unsigned long long#define all(x) (x).begin(), (x).end()#define clr(a, v) memset( a , v , sizeof(a) )#define pb push_back#define RDI(a) scanf ( "%d", &a )#define RDII(a, b) scanf ( "%d%d", &a, &b )#define RDIII(a, b, c) scanf ( "%d%d%d", &a, &b, &c )#define RS(s) scanf ( "%s", s )#define PI(a) printf ( "%d", a )#define PIL(a) printf ( "%d\n", a )#define PII(a,b) printf ( "%d %d", a, b )#define PIIL(a,b) printf ( "%d %d\n", a, b )#define PIII(a,b,c) printf ( "%d %d %d", a, b, c )#define PIIIL(a,b,c) printf ( "%d %d %d\n", a, b, c )#define PL() printf ( "\n" )#define PSL(s) printf ( "%s\n", s )#define rep(i,m,n) for ( int i = m; i < n; i ++ )#define REP(i,m,n) for ( int i = m; i <= n; i ++ )#define dep(i,m,n) for ( int i = m; i > n; i -- )#define DEP(i,m,n) for ( int i = m; i >= n; i -- )#define repi(i,m,n,k) for ( int i = m; i < n; i += k )#define REPI(i,m,n,k) for ( int i = m; i <= n; i += k )#define depi(i,m,n,k) for ( int i = m; i > n; i += k )#define DEPI(i,m,n,k) for ( int i = m; i >= n; i -= k )#define READ(f) freopen(f, "r", stdin)#define WRITE(f) freopen(f, "w", stdout)using namespace std;const double pi = acos(-1);template <class T>inline bool RD ( T &ret ){ char c; int sgn; if ( c = getchar(), c ==EOF )return 0; //EOF while ( c != '-' && ( c < '0' || c > '9' ) ) c = getchar(); sgn = ( c == '-' ) ? -1 : 1; ret = ( c == '-' ) ? 0 : ( c - '0' ); while ( c = getchar() , c >= '0' && c <= '9' ) ret = ret * 10 + ( c - '0' ); ret *= sgn; return 1;}inline void PD ( int x ){ if ( x > 9 ) PD ( x / 10 ); putchar ( x % 10 + '0' );}const double eps = 1e-10;const int dir[4][2] = { 1,0, -1,0, 0,1, 0,-1 };struct node{ int x, y, cnt; node(){} node( int _x, int _y ) : x(_x), y(_y) {} node( int _x, int _y, int _cnt ) : x(_x), y(_y), cnt(_cnt) {}};ll dp[100005];ll num[100005];int main(){ int n; while ( RDI ( n ) != EOF && n ){ clr ( dp, 0 ); REP ( i, 1, n ) scanf ( "%lld", &num[i] ); ll ans = -1e9; REP ( i, 1, n ){ rep ( j, 0, i ){ if ( num[i] > num[j] ){ dp[i] = max ( dp[i], dp[j] + num[i] ); ans = max ( ans, dp[i] ); } } } printf ( "%lld\n", ans ); } return 0;}
0 0
- hdu/hdoj 1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087 Super Jumping! Jumping! Jumping!
- hdoj 1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087 Super Jumping! Jumping! Jumping!
- hdu/hdoj 1087 Super Jumping! Jumping! Jumping!
- hdoj 1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087 Super Jumping! Jumping! Jumping!
- hdoj 1087 Super Jumping! Jumping! Jumping! 【LIS】
- hdoj 1087Super Jumping! Jumping! Jumping!【dp】
- hdoj 1087Super Jumping! Jumping! Jumping!
- hdoj 1087 Super Jumping! Jumping! Jumping!
- HDOJ-1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087 Super Jumping! Jumping! Jumping!(DP)
- HDOJ 1087 Super Jumping! Jumping! Jumping!
- hdoj 1087Super Jumping! Jumping! Jumping!《《dp》》
- hdoj 1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087-Super Jumping! Jumping! Jumping!【DP】
- WUSTOJ-1314: 奇怪的电子屏
- 你这么优秀,为什么还是会被炒鱿鱼?
- Android退出时退出所有Activity的通用类,ActivityManager
- Java学习笔记(4)——Java中的main函数
- .x file format 详细分析.x 文件格式
- HDOJ 1087 Super Jumping! Jumping! Jumping!
- 解读数据分析是神马?
- Shape Context字符识别
- 浅谈DirectX的模型加载
- Java程序员最常用的8个Java日志框架
- UML类图关系(泛化 、继承、实现、依赖、关联、聚合、组合)
- Android之Context和Activity互相转换
- 报表开发实例——动态多层次KPI钻取报表(II)
- Web应用上线之前程序员应该了解的技术细节