codeforces 754A(思维题)
来源:互联网 发布:淘宝店铺如何刷信誉 编辑:程序博客网 时间:2024/06/05 11:30
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 arrayA 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 arrayA.
Lesha is tired now so he asked you to split the array. Help Lesha!
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.
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 integerk — the number of new arrays. In each of the nextk lines print two integers li and ri which denote the subarrayA[li...ri] of the initial array A being the i-th new array. Integersli,ri should satisfy the following conditions:
- l1 = 1
- rk = n
- ri + 1 = li + 1 for each1 ≤ i < k.
If there are multiple answers, print any of them.
31 2 -3
YES21 23 3
89 -12 3 4 -4 -10 7 3
YES21 23 8
10
NO
41 2 3 -5
YES41 12 23 34 4
/*题意让你将一个数组任意拆分为多个数组,按照原来的元素的顺序,满足的条件是每组数组的和不能为0,这些数组元素必须是原来的顺序一个接一个,可能会有多种解人以输出一个即可*/
/*思路:最简单的方法就是将原来的数组拆分为的数组只含有一个元素,保证每个元素不为零,需要特判,可能原来数组有多个0,都为0,前半部分为0,后半部分为0,中间部分为0的情况。详情见代码*/
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int num[200];int main(){ int n; while(scanf("%d", &n) != EOF){ memset(num, 0, sizeof(num)); int cnt = 0; for(int i = 1; i <= n; i++){ scanf("%d", &num[i]); if(num[i] == 0) ++cnt; } int flag = 0; int f0 = 0; if(cnt == n){ //按照这种思路输出为no的情况只有所有元素为0(cnt统计的是0的个数) printf("NO\n"); continue; } else{ printf("YES\n"); int t = n - cnt; printf("%d\n", t); for(int i = 1; i <= n; i++){ if(t == 1) { //这里表示当前只有一个数字不为零其他都为0那么只用输出一组即可 printf("%d %d\n", i, n); break; } else { if(num[i] == 0){ if(!f0){ //若当前为0,直到下一个非0时才能停止那么需要标记 printf("%d ", i); f0 = 1; } flag = 1; continue; } if(flag){ printf("%d\n", i); flag = 0; f0 = 0; t--; //这里的原因是为了解决若有多个0 continue; } else{ printf("%d %d\n", i, i); t--; } } } } } return 0;}
- codeforces 754A(思维题)
- codeforces-754【A思维】
- 【codeforces】A. Array(思维水题)
- CodeForces - 417A(思维题)
- Codeforces 424A (思维题)
- codeforces 856A (思维)
- codeforces 764C Timofey and a tree (思维题)
- Codeforces Round #411 A.Fake NP (思维题)
- 【codeforces】A. The Text Splitting(思维题-水题)
- CodeForces 305A Strange Addition(思维题)
- CodeForces 714A 思维题 C
- CodeForces 348A Mafia (思维)
- codeforces 359A- Table(简单思维)
- Codeforces 134A-Average Numbers(思维)
- Codeforces 135A-Replacement(思维)
- CodeForces 598A Tricky Sum(思维)
- 【CodeForces】300A - Array(思维)
- 【CodeForces】699A - One Bomb(思维)
- 【SDR】LTE信道仿真模型-EPA信道
- 深入理解JavaScript系列(6):S.O.L.I.D五大原则之单一职责SRP
- B
- centos 安装
- re.sub 使用方法
- codeforces 754A(思维题)
- 多线程的实现方式
- 深入理解JavaScript系列(7):S.O.L.I.D五大原则之开闭原则OCP
- 大数相乘
- springMVC的一个controller方法怎么处理多个请求地址
- Tomcat的简单配置
- 13 QT的QProcess与进程间的通信
- cron表达式轮询操作
- 导航条实例(哔哩哔哩部分)