1007. Maximum Subsequence Sum (25) 第二种想法
来源:互联网 发布:java迭代器 实现类 编辑:程序博客网 时间:2024/06/05 05:11
1007. Maximum Subsequence Sum (25)
Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1 <= i <= j <= K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.
Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.
Input Specification:
Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (<= 10000). The second line contains K numbers, separated by a space.
Output Specification:
For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.
Sample Input:10-10 1 2 3 4 -5 -23 3 7 -21Sample Output:
10 1 4
额 第二种想法算法复杂度大概是n³ 然后超时了 还有个答案运算错误了
#include<iostream>using namespace std;int n[10012];int main(){int k;cin>>k;bool flag=false;for(int i=0;i<k;i++){cin>>n[i];if(n[i]>=0) flag=1;}if(!flag) cout<<"0 "<<n[1]<<" "<<n[k]<<endl;else{int max=0,a=0,b=0;for(int j=k;j;j--){int x=k-j;for( int h=0;h<=x;h++){int sum=0;for(int i=0;i<j;i++){sum+=n[i+h];if(sum>max) { max=sum; a=n[h]; b=n[i+h];} }}}cout<<max<<" "<<a<<" "<<b<<endl;}return 0;}
- 1007. Maximum Subsequence Sum (25) 第二种想法
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- 缓存穿透与缓存雪崩
- iOS10使用已有证书和描述文件真机
- FlipShare
- 有关SQL中取前几条数据
- Xcode8 兼容iOS 10 整理笔记
- 1007. Maximum Subsequence Sum (25) 第二种想法
- 快速构建AngularJs 2.0 教程
- iOS10 注册极光推送(干货)
- 基于Vue的简单的单页面应用
- ★leetcode10_Regular Expression Matching[附动态规划]
- 361M以下的Linux名单
- 5. Longest Palindromic Substring(最长回文串)
- Jersey在spring环境下的实现
- 《汇编语言》学习(一)基础知识