백준 12847번: 꿀 아르바이트

www.acmicpc.net/problem/12847

12847번: 꿀 아르바이트

 

백준 12847번 꿀 아르바이트.pptx

0.04MB

 

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
#define c_reverse(s) reverse(s.begin(), s.end())
#define c_sort(s) sort(s.begin(), s.end())
 
#define print_vector(v) for(int i=0; i<v.size(); i++) cout << v[i];
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
 
    int n, m; cin >> n >> m;
    vector<long long> arr(n+1);
    for (int i = 1; i < n+1; i++) {
        cin >> arr[i];
        arr[i] = arr[i - 1] + arr[i];
    }
 
    long long sol = 0;
    for (int i = m; i < n+1; i++) {
        long long cand = arr[i] - arr[i - m];
 
        if (cand > sol) {
            sol = cand;
        }
    }
 
    cout << sol << CENDL;
    return 0;
}