求最大子序列的实现
来源:互联网 发布:游戏角色设计软件 编辑:程序博客网 时间:2024/06/05 08:12
求最大子序列 C 源码的实现
先看原题
Maximum Subsequence Sum
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. TheMaximum 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 -21
Sample Output:
10 1 4
http://www.patest.cn/contests/mooc-ds/01-2
C代码实现,基于在线处理算法,算法时间复杂度O(n)
#include <stdio.h>#include <stdlib.h>int MaxSubSum(int A[], int N, int* start, int* end){ int nMaxSum=-1, i=0,nThisSum=0,temp =0; *start = A[0]; *end = A[N-1]; for( i =0; i<N; ++i) { nThisSum += A[i]; if(nThisSum < 0) { nThisSum = 0; temp = i+1; } else if(nThisSum > nMaxSum) { nMaxSum = nThisSum; *start = A[temp]; *end = A[i]; } } if(nMaxSum <0) nMaxSum = 0; return nMaxSum;}int main(){ int i; int k; scanf("%d",&k); int *a = (int*)malloc(sizeof(int)*k); for( i =0; i < k; ++i) { scanf("%d",&a[i]); } int start,end; int ret = MaxSubSum(a, k, &start, &end); printf("%d %d %d", ret, start, end); free(a); return 0;}
- 求最大子序列的实现
- 求所有最大公共子序列的算法实现
- 求所有最大公共子序列的算法实现
- 求所有最大公共子序列的算法实现
- 求所有最大公共子序列的算法实现
- 求所有最大公共子序列的算法实现
- 求所有最大公共子序列的算法实现(转)
- 求所有最大公共子序列的算法实现(转)
- 求序列的最大子序列
- 求最大子序列
- 求最大子序列
- 求最大子序列
- 求最大子序列
- 求最大子序列的算法
- 求数组中和最大的子序列
- 求最大子序列的和
- 求连续子序列的最大和
- 求数组的最大子序列和
- 【JS/JQ】判断文本框输入的只能是…
- setlocale同mbstowcs函数的关系
- .NET Oracle Developer的福音——ODP.NET Managed正式推出
- HDU 2061 Treasure the new start, freshmen!
- 利用字典树查找唯一标记某单词的最小前缀
- 求最大子序列的实现
- unity3D--数据库
- 替换掉字符串中的空格
- Java中的static关键字解析
- 韩顺平php视频笔记38-41 php数据类型(部分)
- POJ 2387 Til the Cows Come Home
- ThinkPHP3.1.3核心类 Dispatcher.class.php
- 初识银行软件测试
- unity3D---SQL