(水水水)zoj 1622 switch

ZOJ Problem Set - 1622

Switch

---

Time Limit: 1 Second      Memory Limit: 32768 KB

---

There are N lights in a line. Given the states (on/off) of the lights, your task is to determine at least how many lights should be switched (from on to off, or from off to on), in order to make the lights on and off alternatively.

Input

One line for each testcase.

The integer N (1 <= N <= 10000) comes first and is followed by N integers representing the states of the lights ("1" for on and "0" for off).

Process to the end-of-file.

Output

For each testcase output a line consists of only the least times of switches.

Sample Input

3 1 1 1
3 1 0 1

Sample Output

1
0

题意很简单要求是给你一组数，要求让这组数0 1 相间，如果不满足问至少调整几个就能满足题意。

#include <stdio.h>int main(void){//freopen("out.txt","r",stdin);freopen("my.txt", "w", stdout );int n;int a[10005],i;while (scanf("%d",&n) != EOF){int count = 0,count1=0;for (i=0;i<n;i++)scanf("%d",&a[i]);i = 0;while (1){if (a[i])count++;elsecount1++;i++;if (i>=n) break;if (a[i])count1++;elsecount++;i++;if (i>=n) break;}printf("%d/n",count>count1?count1:count);}return 0;}