P1614 爱与愁的心痛

#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<deque>

using namespace std;


int main() {
    int n, m;
    scanf("%d%d", &n, &m);
    vector<int> v;
    bool flag = false;
    if (n == m)
        flag = true;
    int num;
    while (n--)
        scanf("%d", &num), v.push_back(num);
    int l = 0, r = 0;
    if(flag){
        int total=0;
        for(int i=0;i<v.size();i++)
            total+=v[i];
        printf("%d\n", total);
        return 0;
    }
    //r-l+1==m
    deque<int> d;
    int minNum = 1 << 30;
    for (int i = 0; i < v.size(); i++) {
        if (r - l + 1 <= m)
            d.push_back(v[i]), r++;
        else {
            int total = 0;
            for (int i = 0; i < d.size(); i++) {
                total += d[i];
            }
            minNum = min(minNum, total);
            d.erase(d.begin());
            l++;
            i--;
        }
    }
    printf("%d\n", minNum);
    return 0;
}