题意:给定n个石子,一个数组a,每次可以取走数组中某个数的石子数,求先手最多取多少个。
思路:设dp[i]表示i个石子,先手最多取多少个。
/*keep on going and never give up*/
#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define lowbit(x) x&(-x)
#define endl '\n'
#define wk is zqx ta die
int a[105];
int dp[10005];
signed main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cin >> a[i];
}
dp[1] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (a[j] <= i) {
dp[i] = max(dp[i], i - dp[i - a[j]]);
}
}
}
cout << dp[n] << endl;
return 0;
}