Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <set>
- #include <map>
- #include <algorithm>
- #include <cmath>
- using namespace std;
- int main()
- {
- int n, k;
- cin >> n >> k;
- vector<int> a(n + 1);
- vector<vector<int> > dp(k + 1, vector<int> (n + 1, -2e9));
- dp[0][0] = 0;
- for (int i = 1; i <= n; ++i)
- {
- cin >> a[i];
- }
- if (k < n || k >= 400)
- {
- cout << "Impossible";
- return 0;
- }
- for (int i = 1; i <= k; ++i)
- {
- for (int j = 1; j <= n; ++j)
- {
- for (int q = 1; q <= n; ++q)
- {
- if (i >= q + 1 && j >= q)
- {
- dp[i][j] = max(dp[i][j], dp[i - q - 1][i - q] + a[q]);
- }
- if (i >= q && j >= q)
- {
- dp[i][j] = max(dp[i][j], dp[i - q][j - q] + a[q]);
- }
- }
- }
- }
- int maxn = 450;
- bool dp1[maxn][maxn];
- dp1[0][0] = 1;
- for (int i = 1; i < maxn; ++i) {
- for (int j = 1; j < maxn; ++j) {
- for (int k = 1; k < maxn; ++k) {
- if (i >= k && j >= k)
- dp1[i][j] = max(dp1[i][j], dp1[i - k][j - k]);
- if (i >= k + 1 && j >= k)
- dp1[i][j] = max(dp1[i][j], dp1[i - k - 1][j - k]);
- }
- }
- }
- int ans = -1;
- for (int i = 0; i <= k; ++i)
- {
- for (int j = 0; j <= n; ++j)
- {
- if (dp1[k - i][n - j])
- {
- ans = max(ans, dp[i][j]);
- }
- }
- }
- cout << ans;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement