Codeforces 803 B
来源:互联网 发布:虚拟机linux网不可用 编辑:程序博客网 时间:2024/06/05 15:25
You are given the array of integer numbers a0, a1, ..., an - 1. For each element find the distance to the nearest zero (to the element which equals to zero). There is at least one zero element in the given array.
The first line contains integer n (1 ≤ n ≤ 2·105) — length of the arraya. The second line contains integer elements of the array separated by single spaces ( - 109 ≤ ai ≤ 109).
Print the sequence d0, d1, ..., dn - 1, wheredi is the difference of indices betweeni and nearestj such thataj = 0. It is possible thati = j.
Input
92 1 0 3 0 0 3 2 4
Output
2 1 0 1 0 0 1 2 3
Input
50 1 2 3 4
Output
0 1 2 3 4
Input
75 6 0 1 -2 3 4
Output
2 1 0 1 2 3 4
就是输出每个数字与离它最近的0的距离
#include<iostream>#include<cstring>#include<algorithm>using namespace std;int zero[200000];int main(){memset(zero,0,4);int n;cin>>n;int m;int count=0;for(int i=0;i<n;i++){cin>>m;if(m==0) zero[count++]=i;}int a=0;int flag=0;for(int i=0;i<n;i++){flag=abs(i-zero[a]);if(a>0){if(flag>0){flag=min(flag,abs(i-zero[a-1]));}}if(flag==0) a++;if(i!=0) cout<<" "<<flag;else cout<<flag;}}
阅读全文
0 0
- Codeforces 803 B
- codeforces B
- codeforces B
- codeforces B
- codeforces B
- Codeforces 803 B. Distances to Zero (模拟
- Codeforces 803B Distances to Zero 题解
- CodeForces 803B Distances to Zero
- 【Codeforces 803 B. Distances to Zero】
- Codeforces 803 B. Distances to Zero 模拟
- CodeForces 626B CodeForces 626B【暴力】
- CodeForces 841B (B) 博弈
- codeforces 134B
- codeforces#98 b
- codeforces 105 div2 B
- Codeforces 166B - Polygons
- codeforces B. Coins
- codeforces----193B Xor
- 迪杰斯特拉算法python实现
- Node.js简介
- 关于响应式布局的一些笔记---未完待续
- 【小白成长史】overflow: hidden
- Sciter中订阅事件的几种方式
- Codeforces 803 B
- Centos 7 如何卸载docker
- 解决eclipse项目验证缓慢问题
- c++ list, vector, map, set 区别与用法比较
- gpufilter for the demo download
- CUDA知识普及
- 初识linux之ubuntu
- STM32学习笔记一一定时器中断
- 平稳多元序列建模