-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path求max值的子列.cpp
39 lines (35 loc) · 2.4 KB
/
求max值的子列.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
#include <iostream>
#define maxsize 100000+100
using namespace std;
int A[maxsize];
int S[maxsize];
int MaxSubseqSum(int A[], int N)
{
int ThisSum, MaxSum;
int i;
ThisSum = MaxSum = 0;
for (int i = 0; i < N; ++i)
{
/* code */
ThisSum += A[i]
if (ThisSum > MaxSum)
{
/* code */
MaxSum = ThisSum;
}
else if (ThisSum < 0) //algorthm core, analyze everytime, if it is negtive ,drop it
ThisSum = 0;
}
return MaxSum;
}
int main(){
int num, max;
cin>>num;
for(i = 0;i < num; i++)
{
cin>>A[i];
}
max = MaxSubseqSum(A,num);
cout<<max<<endl;
return 0;
}