7-1 Maximum Subsequence Sum (25 分)
一、题目
二、代码
#include <iostream>
using namespace std;
int main(){
int k;
cin>>k;
int a[k], thisSum = 0, maxSum = -1, tag = 0, firstNum = 0, lastNum = 0;
int temp_first = 0;
for(int i =...
原创
2018-12-12 22:07:57 ·
487 阅读 ·
0 评论