hdu - 1087 - Super Jumping! Jumping! Jumping!
来源:互联网 发布:ovd后缀名是什么软件 编辑:程序博客网 时间:2024/05/17 00:10
题意:求最大升序和。
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1087
——>>设d[i]表示以第i个数为终点的最大升序和,然后从第1个数到第i-1个数为终点的最大升序和进行检查,向后递推即可。
#include <iostream>#include <algorithm>using namespace std;int main(){ int N, a[1010], i, j; long long d[1010]; //d[i]表示以第i个数为终点的最大升序和 while(cin>>N) { if(!N) return 0; for(i = 1; i <= N; i++) { cin>>a[i]; d[i] = a[i]; //最小为其自己,无左拓展 } long long max_sum = a[1]; //最大升序和存进max_sum for(i = 2; i <= N; i++) //第1个一定是它自己,故从第2个数开始 for(j = 1; j < i; j++) { if(a[j] < a[i]) d[i] = max(d[i], d[j]+a[i]); //如果是升序,更新 max_sum = max(max_sum, d[i]); //更新 } cout<<max_sum<<endl; } return 0;}
今天用Java做了一次:
import java.util.Scanner;public class Main {static final int maxn = 1000 + 10;public static void main(String[] args) {Scanner cin = new Scanner(System.in);int N, a[] = new int[maxn];long d[] = new long[maxn];while(cin.hasNextInt()){N = cin.nextInt();if(N == 0) break;for(int i = 1; i <= N; i++) d[i] = a[i] = cin.nextInt();long max = -1;for(int i = 1; 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(d[i] > max) max = d[i];}System.out.println(max);}cin.close();}}
- hdu/hdoj 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- Hdu 1087 - Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!
- Hdu 1087 Super Jumping! Jumping! Jumping!
- hdu - 1087 - Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping! DP
- STM32学习笔记(6.1):LCD的显示
- 理解Framework中的泛型(第十三课)
- Google、iPhone手机秘密追踪行为将被诉讼
- STM32学习笔记(6.2):LCD的显示
- STM32 USART的使用
- hdu - 1087 - Super Jumping! Jumping! Jumping!
- 【双端队列】滑动的窗户 window
- Building a Dynamic UI with Fragments
- 遍历序列与二叉树的复原
- MYSQL高效率地装载数据解决方案
- HDU 2821 Pusher
- Exchange Server 2013架构设计示例一
- 多线程编程技术(第十四课)
- Exchange Server 2013架构设计示例二