#include <bits/stdc++.h>
#define pb push_back
#define int long long
using namespace std;
const int N=1e3+5;
int v[N];
void solve()
{
int n;
cin>>n;
for(int i=1;i<=n;++i) cin>>v[i];
vector<bool> ans(n+5,1);
vector<int> dp(50005);
for(int i=1;i<=n;++i)
{
dp[v[i]]=i;
for(int j=50000;j>v[i];--j) dp[j]=max(dp[j],dp[j-v[i]]);
int ss=0;
for(int j=i;j>=1;--j)
{
ss+=v[j];
if(ss&1) {ans[i-j+1]=0;continue;}
if(dp[ss/2]<j) ans[i-j+1]=0;
}
}
vector<int> ot;
for(int i=1;i<=n;++i) if(ans[i]) ot.pb(i);
cout<<ot.size()<<" ";
for(auto x:ot) cout<<x<<" ";
}
signed main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t=1;cin>>t;
while(t--) {solve();cout<<'\n';}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |