Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- Рубрика "АНЕКРВ КОММЕНТАХ":
- В дверь постучали 1024 раза. Килобайт - подумал Штирлиц.
- Дурак - подумали 128 осьминогов
- */
- #define _CRT_SECURE_NO_DEPRECATE
- #pragma warning(disable:4996)
- //#pragma optimize( "g", on )
- #include <iostream>
- #define _USE_MATH_DEFINES
- #include <math.h>
- #include <cmath>
- #include <vector>
- #include <map>
- #include <stack>
- #include <set>
- #include <queue>
- #include <iomanip>
- #include <deque>
- #include <string>
- #include <algorithm>
- #include <numeric>
- using namespace std;
- #define ll long long
- #define ull unsigned long long
- int main() {
- cin.tie(NULL);
- cout.tie(NULL);
- ios_base::sync_with_stdio(false);
- //freopen("INPUT.TXT", "r", stdin);
- //freopen("OUTPUT.TXT", "w", stdout);
- //cout << fixed << setprecision(15);
- ll n, k;
- cin >> n >> k;
- vector<ll> vc(n), dp(n);
- if (n == 1) {
- cin >> n;
- cout << n;
- return 0;
- }
- /*
- 8 2
- 1 6 1 1 9 10 1 10
- */
- for (ll i = 0; i < n; i++)
- cin >> vc[i];
- dp[n - 1] = vc[n - 1];
- for (ll i = n-2; i >= 0; i--) {
- ll dop = 0;
- if (i + 1 + k < n)
- dop = dp[i + 1 + k];
- if (vc[i] + dop > vc[i + 1])
- dp[i] = vc[i] + dop;
- else
- dp[i] = vc[i + 1];
- }
- ll res = dp[0];
- for (ll i = 1; i < n; i++)
- if (dp[i] > res)
- res = dp[i];
- cout << res;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement