Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main() {
- ios_base::sync_with_stdio(false);
- cin.tie(nullptr);
- cout.tie(nullptr);
- int N;
- cin >> N;
- vector < int > a(N + 1);
- for(int i = 1; i <= N; ++i)
- cin >> a[i];
- vector < int > dp(10001, -1);
- // dp[x] = y <=> la vanzarea a x litri administratorul mai mare maximum y litri in butoi
- int mx = 0;
- dp[0] = 0;
- for(int i = 1; i <= N; ++i) {
- for(int j = mx; j >= 0; --j)
- if(dp[j] >= a[i] && dp[j + a[i]] < dp[j] - a[i]) { // vreau sa vand j + a[i] litri(j sigur am vandut pana acum)
- dp[j + a[i]] = dp[j] - a[i]; // Pentru asta din dp[j] litri cati mai am maxim pierd a[i]
- mx = max(mx, j + a[i]); // daca am ajuns pana aici, sigur pot vinde j + a[i] si verific daca e maxim
- }
- dp[0] += a[i]; // dp[0] considera ca n-a vandut nimic pana acum de ex
- }
- cout << mx;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement