题目:https://www.nowcoder.com/questionTerminal/937d8a6766a5488d958d55ddf3ec5cef
#include<iostream>
#include<vector>
#include <algorithm>
using namespace std;
int main() {
int n, a, b;
cin >> n;
vector<vector<int>> value(n);
for (int i = 0; i < n;i++) {
cin >> a >> b;
value[i].push_back(a);
value[i].push_back(b);
}
vector<int> dp(n+1);
dp[1] = max(value[0][0], value[0][1]);
for (int i = 2; i < n+1 ; ++i) {
dp[i] = max(dp[i-1]+value[i-1][0], dp[i-2]+value[i-1][1]);
}
cout << dp[n];
}