maximum sum sbsequence such that no two are adjacent(O(n) solution, optimal)

#include<bits/stdc++.h>
using namespace std;
int maxSum(vector<int>&v){
    int n=v.size();
    if(n==0)
        return 0;
    int incl=v[0];
    int excl=0;
    for(int i=1;i<n;i++){
        int temp=excl;
        excl=max(incl,excl);
        incl=temp+v[i];

    }

    return max(incl,excl);

}

int main(){
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        vector<int>v(n);
        for(int i=0;i<n;i++){
            cin>>v[i];
        }
        cout<<maxSum(v)<<endl;
    }
    return 0;
}