[CROC-MBTU 2012, Final Round (Online version, Div. 2)]A. Paper Work

地址：http://codeforces.com/contest/250/problem/A

将一个数列分割，每个子数列中负数个数不能多于两个，输出分割的块数，依次输出每个子数列的长度

 1 #include<stdio.h>
 2 
 3 int n,d[100];
 4 
 5 int main()
 6 {
 7     int i,j=0,in,count=0;
 8     scanf("%d",&n);
 9     for(i=0;i<n;i++)
10     {
11         scanf("%d",&in);
12         if(in<0) count++;
13         if(count>=3) {j++;count=1;}
14         d[j]++;
15     }
16     printf("%d\n",j=j+1);
17     for(i=0;i<j;i++)
18     {
19         printf("%d ",d[i]);
20     }
21     printf("\n");
22     return 0;
23 }

 

转载于:https://www.cnblogs.com/tjsuhst/archive/2013/01/18/2867070.html