可降橙

#include<bits/stdc++.h>
using namespace std;
const int mn = 1e5+9;
int a[mn],b[mn],c[mn],dp[mn][3];
int main(){
    int n;
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> a[i] >> b[i] >> c[i];
    }
    dp[1][0] = a[1];
    dp[1][1] = b[1];
    dp[1][2] = c[1];
    for(int i=2;i<=n;i++){
        dp[i][0] = max(dp[i-1][1],dp[i-1][2])+a[i];
        dp[i][1] = max(dp[i-1][0],dp[i-1][2])+b[i];
        dp[i][2] = max(dp[i-1][1],dp[i-1][0])+c[i];
    }
    cout << max(dp[n][0],max(dp[n][1],dp[n][2]));
    return 0;
}

求赞