题目:
输入样例:
6
-2 11 -4 13 -5 -2(结尾无空行)输出样例:
20(结尾无空行)
主函数:
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int MaxSubseqSum1(vector<int>List, int N);//算法1
int MaxSubseqSum2(vector<int>List, int N);//算法2
int MaxSubseqSum3(vector<int>List, int N);//算法3
int MaxSubseqSum4(vector<int>List, int N);//算法4
int main()
{
int sum, x, i;
vector<int>List;
scanf("%d",&sum);
for(i=0;i<sum;i++){
scanf("%d",&x);
List.push_back(x);
}
printf("%d ",MaxSubseqSum1(Lis