题解 | 小苯的最大和

#include <iostream>

using namespace std;

typedef long long LL;
const int N = 2e5 + 10;
int a[N];
LL f[N];

int main() {
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        for(int i = 1;i <= n;i++){
            cin>>a[i];
        }
        for(int i = 1;i <= n;i++){
            f[i] = f[i - 1] + a[i];
            if(i >= 2) f[i] = max(f[i - 2],f[i]);
            if(i >= 3) f[i] = max(f[i - 3],f[i]);
        }
        cout<<f[n]<<"\n";
    }
}
// 64 位输出请用 printf("%lld")