maximum subsequence sum such that no two elemnts are adjacent(n^2 solution, non optimal)

#include<bits/stdc++.h>
using namespace std;
int maxSum(vector<int>&v){
    int n=v.size();
    if(n==0)
        return 0;
    vector<int>dp(n);
    for(int i=0;i<n;i++){
        dp[i]=v[i];
    }
    int ans=v[0];
    for(int i=1;i<n;i++){
        for(int j=0;j<i-1;j++){
            if(v[i]+dp[j]>dp[i]){
                dp[i]=dp[j]+v[i];
            }
        }

        ans=max(ans,dp[i]);
        // cout<<dp[i]<<" "<<ans<<endl;

    }
    return ans;
}

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;
}