zoukankan      html  css  js  c++  java
  • CF754A

    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 Abeing the i-th new array. Integers liri 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.

    Example

    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
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 #include<cmath>
     5 #include<algorithm>
     6 using namespace std;
     7 int a[105];
     8 int main()
     9 {
    10     int t,i,flag;
    11     long long sum;
    12     while(~scanf("%d",&t))
    13     {
    14         sum=0;
    15         flag=0;
    16        for(i=1;i<=t;i++)
    17        {
    18            cin>>a[i];
    19            sum+=a[i];
    20            if(a[i]&&flag==0)
    21             flag=i;
    22        }
    23        if(!flag)
    24         cout<<"NO"<<endl;
    25        else if(sum)
    26             cout<<"YES"<<endl<<1<<endl<<1<<' '<<t<<endl;
    27         else
    28         {
    29             cout<<"YES"<<endl<<2<<endl<<1<<' '<<flag<<endl<<flag+1<<' '<<t<<endl;
    30         }
    31 
    32     }
    33     return 0;
    34 }
  • 相关阅读:
    JSON库之性能比较:JSON.simple VS GSON VS Jackson VS JSONP
    mysql存储过程批量插入数据
    mysql 5.7.12 winx64安装配置方法图文教程
    mysql-5.7.12-winx64 安装
    spring下载地址
    jdbc动态切换数据库
    Tomcat7 新的数据库连接池Tomcat jdbc pool介绍和配置
    WebSercice Demo
    面试问题之数据结构与算法:最小生成树算法
    面试问题之数据结构与算法:最大连续子序列和
  • 原文地址:https://www.cnblogs.com/--lr/p/6842955.html
Copyright © 2011-2022 走看看