Codeforces 754A Lesha and array splitting

A. Lesha and array splitting

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

One spring day on his way to university Lesha found an array A. Lesha likes to split arrays into several parts. This time Lesha decided to split the array A into several, possibly one, new arrays so that the sum of elements in each of the new arrays is not zero. One more condition is that if we place the new arrays one after another they will form the old array A.

Lesha is tired now so he asked you to split the array. Help Lesha!

Input

The first line contains single integer n (1 ≤ n ≤ 100) — the number of elements in the array A.

The next line contains n integers a1, a2, ..., an ( - 103 ≤ ai ≤ 103) — the elements of the array A.

Output

If it is not possible to split the array A and satisfy all the constraints, print single line containing "NO" (without quotes).

Otherwise in the first line print "YES" (without quotes). In the next line print single integer k — the number of new arrays. In each of the next k lines print two integers li and ri which denote the subarray A[li... ri] of the initial array A being the i-th new array. Integers li, rishould satisfy the following conditions:

• l1 = 1
• rk = n
• ri + 1 = li + 1 for each 1 ≤ i < k.

If there are multiple answers, print any of them.

Examples

input

3
1 2 -3

output

YES
2
1 2
3 3

input

8
9 -12 3 4 -4 -10 7 3

output

YES
2
1 2
3 8

input

1
0

output

NO

input

4
1 2 3 -5

output

YES
4
1 1
2 2
3 3
4 4

题目大意：一个人有一列数，他要把这个数断成若干个和不为0的小段问是否可能。若能则输出其中一种方式。

思路：本题有一个奇怪的观察：如果所有数都是0，显而易见不可能，如果所有数的和为0，找一个和不为0的节点i，1—i和i+1—n一定互为相反数，若数的和不为0，则只分为一段。附代码。

#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<ctime>

using namespace std;

const int MAXN=110;
int a[MAXN],s[MAXN];

int main()
{
	int n,tot=0;
	int p=false;
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		tot+=a[i];
		if (a[i]!=0)
		{
			p=true;
		}
	}
	if (!p)
	{
		cout<<"NO";
		return 0;
	}
	else
	{
		if (tot==0)
		{
			cout<<"YES"<<endl<<2<<endl;
			cout<<1<<' ';
			int t=0,i;
			for (i=1;i<=n;i++)
			{
				t+=a[i];
				if (t!=0)
				{
					cout<<i<<endl;
					break;
				}
			}e s
			cout<<i+1<<' '<<n;
		}
		else
		{
			cout<<"YES"<<endl<<1<<endl;
			cout<<1<<' '<<n;
		} 
	}
    return 0;
}