【codeforces 754A】Lesha and array splitting

time limit per test2 seconds

memory limit per test256 megabytes

inputstandard input

outputstandard 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, ri should 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

【题目链接】:http://codeforces.com/contest/754/problem/A

【题解】



求前缀和;

看看pre[n]等于多少;

pre[n]!=0;

则直接整个数组全部输出;

如果pre[n]==0

则在前面找一个i

pre[i]!=0

如果找到了

则

输出a[1..i]和a[i+1..n];

可以看成是pre[0]=0,pre[i]!=0,pre[n]=0

则可知这两段都是符合要求的不为0;

但是如果没有找到pre[i]!=0

那么就意味着pre[1..n-1]都为0;则数字全为0;则不可能了;

贪心吧。



【完整代码】

#include <bits/stdc++.h>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define LL long long
#define rep1(i,a,b) for (int i = a;i <= b;i++)
#define rep2(i,a,b) for (int i = a;i >= b;i--)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define rei(x) scanf("%d",&x)
#define rel(x) scanf("%I64d",&x)

typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

//const int MAXN = x;
const int dx[9] = {0,1,-1,0,0,-1,-1,1,1};
const int dy[9] = {0,0,0,-1,1,-1,1,-1,1};
const double pi = acos(-1.0);
const int MAXN = 1e2+10;

int n,pre[MAXN],len;

int main()
{
    //freopen("F:\\rush.txt","r",stdin);
    rei(n);
    rep1(i,1,n)
        {
            int x;
            rei(x);
            pre[i] = pre[i-1]+x;
        }
    if (pre[n]!=0)
    {
        puts("YES");
        puts("1");
        printf("%d %d\n",1,n);
    }
    else
    {
        int j = -1;
        rep1(i,1,n-1)
            if (pre[i]!=0)
                j = i;
        if (j==-1)
            puts("NO");
        else
        {
            puts("YES");
            puts("2");
            printf("%d %d\n",1,j);
            printf("%d %d\n",j+1,n);
        }
    }
    return 0;
}