Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #define int long long
- using namespace std;
- int32_t main()
- {
- int n, k;
- cin >> n >> k;
- vector<int> moments(n);
- int prev_max = 0;
- int ans = 0;
- for (int i = 0; i < n; ++i) {
- cin >> moments[i];
- if (i - k >= 0) {
- int condidate = moments[i - k];
- prev_max = max(prev_max, condidate);
- ans = max(ans, prev_max + moments[i]);
- }
- }
- cout << ans;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement