题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1622
题意:有一串电灯,1表示亮,0表示不亮,要转换成亮与不亮间隔着,问最少所需的操作数
代码:
#include <iostream>
#include<cstdio>
using namespace std;
int main()
{
int a[10005];
int n;
int x;
while(scanf("%d",&n)!=EOF)
{
int count1=0;
int count2=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&x);
if((i%2==0 && x!=0) || (i%2!=0 && x!=1))
count1++;
if((i%2!=0 && x!=0) || (i%2==0 && x!=1))
count2++;
}
if(count1<count2)
printf("%d\n",count1);
else
printf("%d\n",count2);
}
return 0;
}