[CROC-MBTU 2012, Final Round (Online version, Div. 2)]A. Paper Work
2013-01-18 22:55
459 查看
地址:http://codeforces.com/contest/250/problem/A
将一个数列分割,每个子数列中负数个数不能多于两个,输出分割的块数,依次输出每个子数列的长度
将一个数列分割,每个子数列中负数个数不能多于两个,输出分割的块数,依次输出每个子数列的长度
#include<stdio.h> int n,d[100]; int main() { int i,j=0,in,count=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&in); if(in<0) count++; if(count>=3) {j++;count=1;} d[j]++; } printf("%d\n",j=j+1); for(i=0;i<j;i++) { printf("%d ",d[i]); } printf("\n"); return 0; }
相关文章推荐
- CROC-MBTU 2012, Final Round (Online version, Div. 2) (同是坑......待填..............无视之)
- CROC-MBTU 2012, Final Round (Online version, Div. 2) A - Paper Work
- CROC-MBTU 2012, Final Round (Online version, Div. 2)总结
- CROC-MBTU 2012, Final Round (Online version, Div. 2)
- CROC-MBTU 2012, Final Round (Online version, Div. 2)笔记
- CROC-MBTU 2012, Final Round (Online version, Div. 2)
- codeforce CROC-MBTU 2012, Final Round (Online version, Div. 2)
- Croc Champ 2013 - Finals (online version, Div. 1)
- CF CROC-MBTU 2012, Final Round div 2
- CF Croc Champ 2013 - Finals (online version, Div. 1) C(greedy)
- Croc Champ 2013 - Finals (online version, Div. 1)
- CF_Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition)
- CROC-MBTU 2012, Elimination Round (ACM-ICPC) E YY题目
- CROC-MBTU 2012, Elimination Round (ACM-ICPC) D题
- CROC-MBTU 2012, Elimination Round (ACM-ICPC)
- CROC-MBTU 2012, Elimination Round (ACM-ICPC)
- Codeforces Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition)
- CROC-MBTU 2012, Elimination Round / 245F Log Stream Analysis (日期处理&二分)
- CROC-MBTU 2012, Elimination Round (ACM-ICPC) 总结
- Codeforces Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition)