This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(){
int t, n, s, sum, op;
cin >> t;
while (t--){
cin >> n;
vector<int> a(n + 1);
vector<bool> k(n + 1);
s = a[0] = k[0] = 0;
for (int i=1; i<n+1; i++){
cin >> a[i];
s += a[i];
k[i] = true;
}
s /= 2;
vector<int> lasti(s + 1, 0);
for (int i=1; i<n+1; i++){
for (int j=s-a[i]; j>0; j--){
lasti[j + a[i]] = max(lasti[j + a[i]], lasti[j]);
}
if (a[i] <= s){
lasti[a[i]] = i;
}
sum = 0;
for (int j=i; j>0; j--){
sum += a[j];
if (sum % 2 || lasti[sum / 2] < j){
k[i - j + 1] = false;
}
}
}
op = 0;
for (int x : k){
if (x){
op++;
}
}
cout << op << " ";
for (int i=1; i<n+1; i++){
if (k[i]){
cout << i << " ";
}
}
cout << "\n";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |