hihocoder #1114

题目链接：http://hihocoder.com/problemset/problem/1114

终于开始刷hihocoder了~

/*
 * Problem: hihocoder #1114 
 * Author:  SHJWUDP
 * Created Time:  2015/4/2 星期四 14:29:53
 * File Name: 233.cpp
 * State: Accepted
 * Memo: function
 */
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int MaxA=1e5+7;

int N;
int arr[MaxA];
int bomb[2][MaxA];
int opA[MaxA], opB[MaxA], la, lb;
bool func(int *b) {
    for(int i=1; i<N; i++) {
        b[i+1]=arr[i]-(b[i]+b[i-1]);
        if(!(0<=b[i+1] && b[i+1]<=1)) return false;
    }
    return b[N]+b[N-1]==arr[N];
}
void solve() {
    bomb[0][0]=bomb[1][0]=0;
    bomb[0][1]=0;
    bool flag1=func(bomb[0]);
    bomb[1][1]=1;
    bool flag2=func(bomb[1]);
    la=0; lb=0;
    if(flag1 && flag2) {
        for(int i=1; i<=N; i++) {
            if(bomb[0][i] == bomb[1][i]) {
                if(bomb[0][i]) opA[la++]=i;
                else opB[lb++]=i;
            }
        }
    } else if(flag1 || flag2){
        int *b=flag1?bomb[0]:bomb[1];
        for(int i=1; i<=N; i++) {
            if(b[i]) opA[la++]=i;
            else opB[lb++]=i;
        }
    }
}
int main() {
#ifndef ONLINE_JUDGE
    freopen("in", "r", stdin);
    //freopen("out", "w", stdout);
#endif
    int T;
    scanf("%d", &T);
    while(T--) {
        scanf("%d", &N);
        for(int i=1; i<=N; i++) {
            scanf("%d", &arr[i]);
        }
    
        solve();
        printf("%d", la);
        for(int i=0; i<la; i++)
            printf(" %d", opA[i]);
        printf("\n%d", lb);
        for(int i=0; i<lb; i++)
            printf(" %d", opB[i]);
        printf("\n");
    }
    return 0;
}