c_cpp 最大总和使得没有两个元素相邻

Posted 2021-05-14

//https://www.geeksforgeeks.org/maximum-sum-such-that-no-two-elements-are-adjacent/
#include <iostream>
using namespace std;

int main() {
    int n;
    cin>>n;
    int a[n];
    for (int i=0;i<n;i++)
        cin>> a[i];
    int inc=a[0], exc=0, ex;

    for (int i=1;i<n;i++) {
        ex= (inc>exc)?inc:exc;

        inc= exc + a[i];
        exc= ex;
    }
    inc>exc?cout<<inc:cout<<exc;
}