2 最大子列和问题2
来源:互联网 发布:无法化成阶梯型矩阵 编辑:程序博客网 时间:2024/05/11 18:31
最大子列和问题2
Given a sequence of K integers
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 KK (\le 10000≤10000). The second line contains KK 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 ii and jj (as shown by the sample case). If all the KK 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 -21
Sample Output:
10 1 4
#include<stdio.h>#define MAX 10001using namespace std;int main(){ int n, sum, temp; int max, flag=1; int A[MAX]; int i, j, begin, end; scanf("%d", &n); for(i = 0; i < n; i++){ scanf("%d", &A[i]); if(A[i]>=0) flag=0; } max = sum = A[0]; begin = end = temp = 0; for(i = 1; i < n; i++){ if(sum < 0){ sum = 0; temp = i; } sum += A[i]; if(sum > max){ max=sum; begin = temp; end = i; } } if(flag) printf("%d %d %d\n", 0, A[0], A[n-1]); else printf("%d %d %d\n", max, A[begin], A[end]); return 0;}
- 2 最大子列和问题2
- 最大子列和问题
- 最大子列和问题
- 最大子列和问题
- 最大子列和问题
- 最大子列和问题
- 最大子列和问题
- 最大子列和问题
- 最大子列和问题
- 最大子列和问题
- 最大子列和问题
- 最大子列和问题
- 最大子列和问题
- 最大子列和问题
- 最大子列和问题
- 最大子列和问题
- 最大子列和问题
- 最大子列和问题
- HEXO主题
- 集合类HashMap的实现细节
- 存储过程,触发器及函数
- Java声明Set时初始化
- MapleStory文件资源解析
- 2 最大子列和问题2
- 2017.4.18
- [最小割] SRM 590 div1 FoxAndCity
- RCTF-200 welpwn 地址泄露实例
- can总线控制器与单片机接口电路解析
- ButterWorth滤波
- LeetCode376. Wiggle Subsequence题解
- 为什么Android的AsyncTask不适合执行长时间操作的任务
- (25)折半插入排序