Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main() {
- int n, k;
- cin >> n >> k;
- int a[k];
- for (int i = 0; i < k; i++)
- cin >> a[i];
- int L, R;
- cin >> L >> R;
- int dp[n + 1][2];
- int pr[n + 1];
- dp[0][0] = dp[0][1] = pr[0] = 0;
- for (int i = 1; i <= n; i++) {
- dp[i][0] = 0;
- for (int j = 0; j < k; j++) {
- if (i >= a[j])
- dp[i][0] = max(dp[i][0], 1 - dp[i - j][1]);
- }
- pr[i] = pr[i - 1] + dp[i][0];
- dp[i][1] = ((R >= i) || ((pr[i - L] - pr[i - R - 1]) != (R - L + 1)));
- }
- cout << (dp[n][0] ? 1 : 2);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement