CF #200 div2 虚拟赛

2014-10-24 02:09:31

晚上开完Linux教程会就兴致勃勃的来打了场以前的cf，比赛中搞了4题，最后一题搞到2点才出来QAQ（其实就是个二分）

A：算块数。

 1 /*************************************************************************
 2     > File Name: a.cpp
 3     > Author: Nature
 4     > Mail: 564374850@qq.com 
 5     > Created Time: Thu 23 Oct 2014 08:11:17 PM CST
 6 ************************************************************************/
 7 
 8 #include <cstdio>
 9 #include <cstring>
10 #include <cstdlib>
11 #include <cmath>
12 #include <vector>
13 #include <map>
14 #include <set>
15 #include <stack>
16 #include <queue>
17 #include <iostream>
18 #include <algorithm>
19 using namespace std;
20 #define lp (p << 1)
21 #define rp (p << 1|1)
22 #define getmid(l,r) (l + (r - l) / 2)
23 #define MP(a,b) make_pair(a,b)
24 typedef long long ll;
25 const int INF = 1 << 30;
26 
27 int n,cnt,pre;
28 char s[5];
29 
30 int main(){
31     pre = -1;
32     cnt = 0;
33     scanf("%d",&n);
34     for(int i = 1; i <= n; ++i){
35         scanf("%s",s);
36         if(s[0] == '0'){
37             if(pre == 0 || pre == -1) ++cnt;
38             pre = 1;
39         }
40         else{
41             if(pre == 1 || pre == -1) ++cnt;
42             pre = 0;
43         }
44     }
45     printf("%d\n",cnt);
46     return 0;
47 }

View Code