1937. 扣分后的最大得分
2021.7.22
一些细节值得学习:
- 二维数组作为滚动数组;
- 将每行的O(n*n)的时间复杂度合并为O(n)
代码示例
typedef long long LL;
const LL INF = 1e10;
const int maxn = 1e5 + 10;
LL dp[2][maxn]; //利用滚动数组进行优化数组
class Solution {
public:
long long maxPoints(vector<vector<int>> &points) {
int n = points.size(), m = points[0].size();
for (int j = 0; j < m; j++) dp[0][j] = points[0][j]; //第一行本身就是最大得分
for (int i = 1; i < n; i++) {
int pi = (i - 1) & 1, ni = i & 1; //滚动数组变换
for (int j = 0; j < m; j++) dp[ni][j] = -INF; //一半滚动数组初始化
LL mx = -INF;
for (int j = 0; j < m; j++) {
mx = max(mx - 1LL, dp[pi][j]);
dp[ni][j] = max(dp[ni][j], mx + points[i][j]);
}
mx = -INF;
for (int j = m - 1; j >= 0; j--) {
mx = max(mx - 1LL, dp[pi][j]);
dp[ni][j] = max(dp[ni][j], mx + points[i][j]);
}
}
LL ans = -INF;
for (int j = 0; j < m; j++)
ans = max(ans, dp[(n - 1) & 1][j]);
return ans;
}
};