1007. Maximum Subsequence Sum
来源:互联网 发布:java的网络编程重要吗 编辑:程序博客网 时间:2024/05/29 15:03
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
{
int n,i,max2=-1,sum=0,Lmax2=0,left=0,Rmax2=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
{
sum+=a[i];
if(sum>max2)
{
max2=sum;
Rmax2=i;
Lmax2=left;
}
if(sum<0)
{
left=i+1;
sum=0;
}
}
if(max2<0)
{
Rmax2=n-1;
max2=0;
}
cout<<max2<<' '<<a[Lmax2]<<' '<<a[Rmax2];
}
- 1007. Maximum Subsequence Sum
- 1007.Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- (PAT)1007. Maximum Subsequence Sum
- (PAT)1007. Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum (25)
- 1007. Maximum Subsequence Sum (25)
- pat 1007. Maximum Subsequence Sum
- 使用UMDH进行内心泄露分析
- javascript DOM的操作,更新,遍历,添加
- 学习python爬虫之菜鸟日记(一)
- 3899
- Shader之学习笔记六
- 1007. Maximum Subsequence Sum
- mysql连接url中useUnicode=true&characterEncoding=UTF-8的作用
- 多通道的同步问题
- 5、流的输入与输出
- leetcode 232. Implement Queue using Stacks
- 表示数值的字符串
- vlc2.2.4在64位ubuntu下的交叉编译
- 3915
- Linux系统mysql远程连接设置