1007. Maximum Subsequence Sum (25)
来源:互联网 发布:js正则手机号码验证 编辑:程序博客网 时间:2024/04/29 05:38
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
#include <stdio.h>#include <stdlib.h>int main(){int k ;int maxi,maxj;int nowi,nowj,i,num;int sum,maxsum,flag=0;scanf("%d",&k);maxsum = -1;sum = 0;for(i=0;i<k;i++){scanf("%d",&num);if(!num){flag = 1;}if(sum == 0 ){nowi = num;}sum += num;nowj = num;if(sum < 0){sum = 0;}if(sum > maxsum){maxsum = sum;maxi = nowi;maxj = nowj;}}if(maxsum == 0){maxj = nowj;}if(flag && maxsum==0){maxi = 0;maxj = 0;}printf("%d %d %d",maxsum,maxi,maxj);//system("pause");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)
- Unity Plane结构体
- linux下mysql修改root密码
- git bash一闪而过 (闪退)
- Hololens入门之凝视
- 1027. 打印沙漏(20)
- 1007. Maximum Subsequence Sum (25)
- Winedt "系统找不到指定文件" 解决办法
- 【《代码整洁之道》精读与演绎】之五 整洁类的书写准则
- 创建第一个Django工程之视图和URL配置,404错误
- ScrollView中放置ListView
- faster-rcnn的记录
- 使用Akka的Actor和Future简单地实现并发处理
- leetcode:Union Find:Surrounded Regions(130)
- 电商网站快速排名的独家秘籍