1007. Maximum Subsequence Sum

最新推荐文章于 2024-10-04 17:07:53 发布

jl18

最新推荐文章于 2024-10-04 17:07:53 发布

阅读量64

点赞数 3

文章标签： c++ 算法开发语言

本文链接：https://blog.csdn.net/m0_61868996/article/details/142456887

版权

滑动窗口求最大连续子序列和

#include <iostream>
#include <vector>
using namespace std;
int main() {
    int n;
    scanf("%d", &n);
    vector<int> v(n);
    int leftindex = 0, rightindex = n - 1, sum = -1, temp = 0, tempindex = 0;
    for (int i = 0; i < n; i++) {
        scanf("%d", &v[i]);
        temp = temp + v[i];
        if (temp < 0) {
            temp = 0;
            tempindex = i + 1;
        } else if (temp > sum) {
            sum = temp;
            leftindex = tempindex;
            rightindex = i;
        }
    }
    if (sum < 0) sum = 0;
    printf("%d %d %d", sum, v[leftindex], v[rightindex]);
    return 0;
}