AcWing 1049. 大盗阿福

AcWing 1049. 大盗阿福

状态图
0代表不盗，1表示盗

#include <stdio.h>
#include <cstring>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <iostream>
#include <map>
#include <cmath>
#include <set>

#define go(i, l, r) for(int i = (l), i##end = (int)(r); i <= i##end; ++i)
#define god(i, r, l) for(int i = (r), i##end = (int)(l); i >= i##end; --i)
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define debug_in  freopen("in.txt","r",stdin)
#define debug_out freopen("out.txt","w",stdout);
#define pb push_back
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const ll maxM = 1e6+10;
const ll inf_int = 1e8;
const ll inf_ll = 1e17;

template<class T>void read(T &x){
    T s=0,w=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    x = s*w;
}
template<class H, class... T> void read(H& h, T&... t) {
    read(h);
    read(t...);
}

void pt(){ cout<<'\n';}
template<class H, class ... T> void pt(H h,T... t){ cout<<" "<<h; pt(t...);}

//--------------------------------------------
const int maxn = 1e5+10;
int T,N;
int a[maxn];
ll f[maxn][2];
void solve(){
    memset(f,0,sizeof f);
    f[1][1] = a[1];f[1][0] = 0;
    f[2][1] = a[2];f[2][0] = a[1];
    for(int i = 3;i<=N;i++){
        f[i][1] = f[i-1][0] + a[i];
        f[i][0] = max(f[i-1][1],f[i-1][0]);
    }
    cout<<max(f[N][0],f[N][1])<<'\n';
}
int main() {
//    debug_in;
//    debug_out;

    read(T);
    while(T--){
        read(N);
        for(int i = 1;i<=N;i++) read(a[i]);
        solve();
    }




    return 0;
}