[BOI2007]Sequence 序列问题 -- 贪心

Luogu 4393

Code:

#include <bits/stdc++.h>
using namespace std;
#define maxn 1000010
#define re register

int n,a[maxn];

inline int read_() {
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9') {
        if(c=='-') f=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9') {
        x=(x<<1)+(x<<3)+c-'0';
        c=getchar();
    }
    return x*f;
}

int main() {
    n=read_();
    for(re int i=1;i<=n;++i) {
        a[i]=read_();
    }
    long long ans=0;
    for(re int i=2;i<=n;++i) {
        ans+=max(a[i],a[i-1]);
    }
    printf("%lld",ans);
    return 0;
}