序列之争1

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
bool cmp(int a, int b)
{
	return a > b;
}
int main()
{
	int n, m;
	cin >> n >> m;
	vector<int> v(n, 0);
	for (int i = 0; i < n; i++)
		cin >> v[i];
	int sum = 0, maxsum = 0;
	for (int i = 0; i <= m; i++)
	{
		sum = 0;//i -> length
		for (int j = 0; j < i; j++)
			sum += v[j];//初始化和为0到m-1
		maxsum = max(sum, maxsum);
		//j,j+1......j+m-1
		// j+1,j+2.....j+m
		for (int j = 0; j + i < n; j++)
		{
			sum += v[j+i]-v[j];
			maxsum = max(sum, maxsum);
		}
	}
	cout << maxsum << endl;
	//system("pause");
	return 0;
}

#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
using namespace std;
int main()
{
    int n, m;
    cin >> n >> m;
    vector<int> arr(n);
    cin >> arr[0];
    for (int i = 1; i < n; ++i)
    {
        cin >> arr[i];
        //将数组设置为前缀和数组
        arr[i] += arr[i - 1];
    }
    deque<int> q;
    int maxNum = arr[0];
    q.push_back(0);
    for (int i = 1; i < n; ++i)
    {
        //前缀和:s[j]-s[k]==a[k+1]+a[k+2]+...a[j],所以单调队列的大小为m+1
        if (!q.empty() && i - q.front() == m + 1)
        {
            q.pop_front();//保证相减时正好有m个数
        }
        //构造单调递增队列
        while ((!q.empty()) && arr[i] <= arr[q.back()])
        {
            q.pop_back();//弹出比当前arr[i]大的所有值
        }//arr[i] > arr[q.back()]
        q.push_back(i);

        /*cout << "当前单调队列为:";
        deque<int>::iterator it;
        for (it = q.begin(); it != q.end(); it++)
            cout << *it << " ";
        cout << endl;

        cout << maxNum << " " << arr[i] - arr[q.front()] << endl;*/
        maxNum = max(maxNum, arr[i] - arr[q.front()]);
    }
    cout << maxNum << endl;
    system("pause");
    return 0;
}