A. 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 arrayA.

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

题目链接：http://codeforces.com/contest/754/problem/D

啊，比赛的时候卡了我一个小时，看见区间，第一反应线段树，然后发现好像可以用可用扫面线水一下，然后我去写扫描线，然后写到一半，GG，还要输出编号，可能是我扫描线的水平不到家，太菜了。

看了大牛的题解，这是个贪心，我们先对左区间进行排序，然后把右区间存到一个优先队列里维护，我们保持优先队列的大小为k，这样因为左区间有序，所以我们for一遍就过去了。

典型的贪心。

代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
struct node{
    int x,y,id;
}xin[400000];
bool cmp(struct node a,struct node b){
    return a.x<b.x;
}
int main(){
    int n,k;
    scanf("%d%d",&n,&k);
    for(int i=0;i<n;i++){
        scanf("%d%d",&xin[i].x,&xin[i].y);
        xin[i].id=i+1;
    }
    sort(xin,xin+n,cmp);
    priority_queue<int ,vector<int >,greater<int > >Q;
    int ans=0,L=0;
    for(int i=0;i<n;i++){
        Q.push(xin[i].y);
        if(Q.size()>k){
            Q.pop();
        }
        int len=Q.top()-xin[i].x+1;
        if(ans<len&&Q.size()==k){
            ans=len;
            L=xin[i].x;
        }
    }
    printf("%d\n",ans);
    if(ans==0){
        for(int i=1;i<=k;i++){
            printf(i==1?"%d":" %d",i);
        }
        return 0*printf("\n");
    }
    for(int i=0;i<n&&k;i++){//注意k的用处，不止控制输出空格，还控制k个
        if(L>=xin[i].x&&ans+L-1<=xin[i].y){
            printf(k--?"%d ":"%d",xin[i].id);
        }
    }
    cout<<endl;
    return 0;
}