Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define _CRT_SECURE_NO_WARNINGS
- #include <iostream>
- #include <algorithm>
- #include <cmath>
- #include <string>
- #include <vector>
- #include <map>
- #include <set>
- //#include "BigInt.h"
- using namespace std;
- #define ll long long
- #define ull unsigned long long
- const ll INF = 999999999999999999;
- const double PI = acos(-1.0);
- void stop()
- {
- #ifndef ONLINE_JUDGE
- system("pause");
- #endif
- exit(0);
- }
- ll A[305];
- pair<ll,ll> F[305];
- int main()
- {
- freopen("d.in", "r", stdin);
- freopen("d.out", "w", stdout);
- ios::sync_with_stdio(false);
- ll m, d, n;
- cin >> m >> d >> n;
- for (ll i = 0; i < n; i++)
- {
- cin >> A[i];
- }
- F[0].first = 1;
- F[0].second = 0;
- for (ll i = 0; i < n; i++)
- {
- for (ll j = n; j >= 0; j--)
- {
- if (F[j].first != 0 && F[j].second + A[i] <= d && (F[j+1].first==0 || F[j+1].first>F[j].first || (F[j+1].first==F[j].first && F[j+1].second>F[j].second+A[i])))
- {
- F[j + 1].first = F[j].first;
- F[j + 1].second = F[j].second + A[i];
- }
- else if (F[j].first != 0 && F[j].first < m && (F[j + 1].first == 0 || F[j + 1].first>F[j].first+1 || (F[j + 1].first == F[j].first+1 && F[j + 1].second>A[i])))
- {
- F[j + 1].first = F[j].first+1;
- F[j + 1].second = A[i];
- }
- }
- }
- for (ll i = n; i >= 0; i--)
- {
- if (F[i].first != 0)
- {
- cout << i;
- stop();
- }
- }
- stop();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement