[Data Structure] Maximum Subsequence Sum
2016-04-17 14:19
501 查看
Given a sequence of KK integers
{ N_1N1, N_2N2,
..., N_KNK }.
A continuous subsequence is defined to be { N_iNi, N_{i+1}Ni+1,
..., N_jNj }
where 1 \le i \le j \le K1≤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.
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 KKnumbers,
separated by a space.
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 KKnumbers
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.
#include <stdio.h>
int main()
{
int k ;
//input the number the sequence has
while ( scanf("%d",&k) != -1 )
{
int a[k];
//input the sequence
for (int i = 0; i < k; i ++)
{ scanf("%d",&a[i]);
}
int tempSum = 0, tempi = 0, tempj, totalSum = 0, start = 0, end = k - 1;
/*
traverse the sequence, use 'tempSum' acculmulate each num, at first, if tempSum >= 0,
put current num in the tempSum, then if tempSum > Sum, update the Sum, and shift the tempj
to this index, else just shift the tempi and tempj to this index.
*/
for (int i = 0; i < k; i ++)
{ if ( tempSum >= 0 )
{ tempSum += a[i];
tempj = i;
}
else
{ tempSum = a[i];
tempi = i;
tempj = i;
}
if ( tempSum > totalSum || ( tempSum == 0 and end == k - 1)/*when the sequence is consist of zero and negative*/)
{
totalSum = tempSum ;
start = tempi;
end = tempj;
}
}
printf("%d %d %d",totalSum,a[start], a[end]);
}
return 0;
}
{ N_1N1, N_2N2,
..., N_KNK }.
A continuous subsequence is defined to be { N_iNi, N_{i+1}Ni+1,
..., N_jNj }
where 1 \le i \le j \le K1≤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 KK (\le10000≤10000).
The second line contains KKnumbers,
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 subsequenceis not unique, output the one with the smallest indices ii and jj (as
shown by the sample case). If all the KKnumbers
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>
int main()
{
int k ;
//input the number the sequence has
while ( scanf("%d",&k) != -1 )
{
int a[k];
//input the sequence
for (int i = 0; i < k; i ++)
{ scanf("%d",&a[i]);
}
int tempSum = 0, tempi = 0, tempj, totalSum = 0, start = 0, end = k - 1;
/*
traverse the sequence, use 'tempSum' acculmulate each num, at first, if tempSum >= 0,
put current num in the tempSum, then if tempSum > Sum, update the Sum, and shift the tempj
to this index, else just shift the tempi and tempj to this index.
*/
for (int i = 0; i < k; i ++)
{ if ( tempSum >= 0 )
{ tempSum += a[i];
tempj = i;
}
else
{ tempSum = a[i];
tempi = i;
tempj = i;
}
if ( tempSum > totalSum || ( tempSum == 0 and end == k - 1)/*when the sequence is consist of zero and negative*/)
{
totalSum = tempSum ;
start = tempi;
end = tempj;
}
}
printf("%d %d %d",totalSum,a[start], a[end]);
}
return 0;
}
相关文章推荐
- C#数据结构之顺序表(SeqList)实例详解
- Lua教程(七):数据结构详解
- 解析从源码分析常见的基于Array的数据结构动态扩容机制的详解
- C#数据结构之队列(Quene)实例详解
- C#数据结构揭秘一
- C#数据结构之单链表(LinkList)实例详解
- 数据结构之Treap详解
- 用C语言举例讲解数据结构中的算法复杂度结与顺序表
- C#数据结构之堆栈(Stack)实例详解
- C#数据结构之双向链表(DbLinkList)实例详解
- JavaScript数据结构和算法之图和图算法
- Java数据结构及算法实例:冒泡排序 Bubble Sort
- Java数据结构及算法实例:插入排序 Insertion Sort
- Java数据结构及算法实例:考拉兹猜想 Collatz Conjecture
- java数据结构之java实现栈
- java数据结构之实现双向链表的示例
- Java数据结构及算法实例:选择排序 Selection Sort
- Java数据结构及算法实例:朴素字符匹配 Brute Force
- Java数据结构及算法实例:汉诺塔问题 Hanoi
- Java数据结构及算法实例:快速计算二进制数中1的个数(Fast Bit Counting)