C2. Make Nonzero Sum

题意：给定一个数组，要求将其分成一些（可能是一个）连续的段，数组中的每个元素都必须在段中出现，即满足l[i]=r[i-1]+1。使得si=ali-ali+1+ali+2-...+-ari，各个线段按照此方式计算的值的和为0。

思路：由于题目对选定线段的数量不做限制，我们将分析的初始状态设为每个元素各成一个集合。对于一个较大的集合来说，我们可以发现，他可以由长度为2与长度为1的集合表示出来。于是我们只考虑将只含一个元素的集合转换为含两个元素的集合。显然，对于初始状态的sum进行分类讨论，sum==0输出1\n1 n，sum<0，将a[i]==-1的数字与它前面的数字组成一个集合。反之则是a[i]==1的数字。

由于abs(sum)<abs(cnt(rev))，其中cnt()表示数组中rev的数量，rev表示需要反转符号的数字。所以只要sum%2==0，就有答案

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<bitset>
#include<cmath>
#include<array>
#include<atomic>
#include<sstream>
#include<stack>
#include<iomanip>
//#include<bits/stdc++.h>

//#define int ll
#define IOS std::ios::sync_with_stdio(false);std::cin.tie(0);
#define pb push_back
#define endl '\n'
#define x first
#define y second
#define Endl endl
#define pre(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,b,a) for(int i=b;i>=a;i--)
#define si(x) scanf("%d", &x);
#define sl(x) scanf("%lld", &x);
#define ss(x) scanf("%s", x);
#define YES {puts("YES");return;}
#define NO {puts("NO"); return;}
#define all(x) x.begin(),x.end()

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<double, double> PDD;
typedef pair<ll, ll> PLL;
const int N = 500010, M = 2 * N, B = N, MOD = 998244353;
const double eps = 1e-7;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;

//int dx[4] = { -1,0,1,0 }, dy[4] = { 0,1,0,-1 };
int dx[8] = { 1,2,2,1,-1,-2,-2,-1 }, dy[8] = { 2,1,-1,-2,-2,-1,1,2 };
int n, m, k;
int a[N];
bool vis[N];

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lowbit(ll x) { return x & -x; }
ll qmi(ll a, ll b, ll MOD) {
	ll res = 1;
	while (b) {
		if (b & 1) res = res * a % MOD;
		a = a * a % MOD;
		b >>= 1;
	}
	return res;
}

inline void init() {}

void slove()
{
	cin >> n;
	for (int i = 1; i <= n; i++) vis[i] = false;
	int num = 0;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		num += a[i];
	}
	if (num & 1) {
		puts("-1");
		return;
	}
	int t = 0;
	vector<int> b;
	if (num > 0) {
		for (int i = 2; i <= n; i++) {
			if (a[i] == 1) {
				t++;
				b.push_back(i);
				i++;
				if (t == num / 2) break;
			}
		}
	}
	if (num < 0) {
		for (int i = 2; i <= n; i++) {
			if (a[i] == -1) {
				t++;
				b.push_back(i);
				i++;
				if (t == (-num) / 2) break;
			}
		}
	}
	printf("%d\n", n - t);
	for (int i = 0; i < b.size(); i++) {
		vis[b[i] - 1] = true;
	}
	for (int i = 1; i <= n; i++) {
		if (!vis[i])
			printf("%d %d\n", i, i);
		else {
			printf("%d %d\n", i, i + 1);
			i++;
		}
	}
}

signed main()
{
	//IOS;
	int _ = 1;
	si(_);
	init();
	while (_--)
	{
		slove();
	}
	return 0;
}
/*

*/