-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path求值最大的子序列同时返回序列头尾值.cpp
62 lines (59 loc) · 2.87 KB
/
求值最大的子序列同时返回序列头尾值.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include <iostream>
#define maxsize 100000+100
using namespace std;
int res[3];
int MaxSubseqSum(int A[], int N)
{
int ThisSum, MaxSum, Start, End;
int flag,temp;
flag = temp = 0;
MaxSum = -1;
ThisSum = Start = End = 0;
for (int i = 0; i < N; ++i)
{
/* code */
ThisSum += A[i];
if (ThisSum > MaxSum)
{
/* code */
MaxSum = ThisSum;
if (flag == 0)
{
Start = temp;
flag = 1;
}
End = i;
}
else if (ThisSum < 0) //algorthm core, analyze everytime, if it is negtive ,drop it
{
ThisSum = 0;
temp = i + 1;
flag = 0;
}
}
if (MaxSum <0)
{
res[0] = 0;
res[1] = A[0];
res[2] = A[N-1];
}
else
{
res[0] = MaxSum;
res[1] = A[Start];
res[2] = A[End];
}
return 0;
}
int main(){
int num, max;
int A[maxsize];
cin>>num;
for(int i = 0;i < num; i++)
{
cin>>A[i];
}
MaxSubseqSum(A,num);
cout<<res[0]<<" "<<res[1]<<" "<<res[2]<<endl;
return 0;
}