-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1.cpp
31 lines (29 loc) · 940 Bytes
/
1.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <vector>
using namespace std;
class Solution {
public:
int stoneGameII(vector<int>& piles) {
int n = piles.size();
vector<int> suffixSums(n + 1);
suffixSums[n - 1] = piles[n - 1];
for (int i = n - 2; i >= 0; i--) {
suffixSums[i] = suffixSums[i + 1] + piles[i];
}
vector<vector<int>> dp(n, vector<int>(n + 1));
for (int i = n - 1; i >= 0; i--) {
for (int m = 1; m <= n; m++) {
if (i + 2 * m >= n) {
dp[i][m] = suffixSums[i];
}
else {
for (int x = 1; x <= 2 * m; x++) {
int opponentScore = dp[i + x][max(x, m)];
int score = suffixSums[i] - opponentScore;
dp[i][m] = max(dp[i][m], score);
}
}
}
}
return dp[0][1];
}
};