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, 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;则不可能了; 贪心吧。
下面给出AC代码:
 1 #include<iostream>
 2 using namespace std;
 3 int n,a[101],i,s,b;
 4 int main()
 5 {
 6     cin>>n;
 7     for(i=1;i<=n;i++)
 8     {
 9         cin>>a[i];
10         s+=a[i];
11         if(a[i])
12            b=i;
13     }
14     if(b==0)
15        cout<<"NO\n";
16     else if(s)
17        cout<<"YES\n1\n"<<1<<" "<<n<<"\n";
18     else
19        cout<<"YES\n2\n"<<1<<" "<<b-1<<"\n"<<b<<" "<<n<<"\n";
20     return 0;
21 }

 


posted @ 2017-05-08 23:19 Angel_Kitty 阅读(...) 评论(...) 编辑 收藏

ACM竞赛&数学建模竞赛 - 创建于 2017年2月2日

这是一位ACM爱好者&数学爱好者的个人站,内容主要是算法&数据结构&数学研究的技术文章,大部分来自学习,部分来源于网络,希望对大家有所帮助。

致力于ACM算法研究工作,喜爱交友,关注互联网前沿技术与趋势。


Font Awesome | Respond.js | Bootstrap中文网