Codeforces Round #390(Div. 2)A. Lesha and array splitting【思维】
来源:互联网 发布:外文数据库 免费搜索 编辑:程序博客网 时间:2024/06/04 18:42
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
题目大意:
给你一个数组A,让你将其分成若干个子数组,使得每个数组中的数字和都不是0.
思路:
将a【i】!=0的部分,设定为一个子数组,对应将a【i】==0的部分,归到其他数组中即可。
Ac代码:
#include<stdio.h>#include<string.h>using namespace std;int a[150];int l[150];int r[150];int main(){ int n; while(~scanf("%d",&n)) { int flag=0; for(int i=1;i<=n;i++) { scanf("%d",&a[i]); if(a[i]!=0)flag=1; } if(flag==0) { printf("NO\n"); continue; } printf("YES\n"); int ans=0; int cont=0; for(int i=1;i<=n;i++) { if(a[i]!=0) { cont++; l[cont]=i; r[cont]=i; } } r[0]=0; l[cont+1]=n+1; for(int i=1;i<=cont;i++) { l[i]=r[i-1]+1; r[i]=l[i+1]-1; } printf("%d\n",cont); for(int i=1;i<=cont;i++) { printf("%d %d\n",l[i],r[i]); } }}
- A. Lesha and array splitting Codeforces Round #390 (Div. 2)
- Codeforces Round #390 (Div. 2)A Lesha and array splitting
- Codeforces Round #390(Div. 2)A. Lesha and array splitting【思维】
- Codeforces Round #390 (Div. 2) - A Lesha and array splitting (贪心)
- 【codeforces 754A】Lesha and array splitting
- Codeforces 754A - Lesha and array splitting
- codeforces 754 A Lesha and array splitting
- CodeForces 754A Lesha and array splitting
- Codeforces 754A Lesha and array splitting
- Lesha and array splitting CodeForces
- A - Lesha and array splitting
- A. Lesha and array splitting
- 754A. Lesha and array splitting
- A. Lesha and array splitting----贪心
- codeforces-754A-Lesha and array splitting(简单分类处理)
- Codeforces Round #210 (Div. 2) C. Levko and Array Recovery && Codeforces 360 A 详解(思维+维护理论值)
- Codeforces Round #410 (Div. 2)-A. Mike and palindrome-思维
- Codeforces Round #253 (Div. 2) E. Artem and Array (思维)
- jdk1.8的HashMap和ConcurrentHashMap
- mybatis学习资源
- POJ 2796 Feel Good 【单调栈】
- 常见排序算法 - 快速排序 (Quick Sort)
- application framework层
- Codeforces Round #390(Div. 2)A. Lesha and array splitting【思维】
- 三、DC/OS运行spark
- Codeforces Round #390(Div. 2)B. Ilya and tic-tac-toe game【模拟】
- Android 性能监控与分析方法
- GiraphV1.1与V1.2之磁盘读写比较
- java-小功能-生产二维码
- sublime使用技巧
- 欢迎使用CSDN-markdown编辑器
- Python的类方法,静态方法,实例方法,类变量,实例变量,静态变量的总结