微讯信息群号1000000_手机商城小程序_市场调研模板_网站建设哪家好公司

2140. 解决智力问题

---

题目链接：2140. 解决智力问题

代码如下：

class Solution {
public:long long mostPoints(vector<vector<int>>& questions) {vector<long long> f(questions.size() + 1);for (int i = 0;i < questions.size();i++) {f[i + 1] = max(f[i + 1], f[i]);auto& q = questions[i];int j = min(i + q[1] + 1, (int)questions.size());f[j] = max(f[j], f[i] + q[0]);}return f[questions.size()];}
};