#include <bits/stdc++.h>
#define maxn 200005
#define MOD 1000000007
using namespace std;
typedef long long ll;
char str[100005];
int main(){
// freopen("in.txt", "r", stdin);
int n;
scanf("%d%s", &n, str);
int m = 'r' + 'b';
int k1 = 'r', k2 = 'b';
int r1 = 0, b1 = 0, r2 = 0, b2 = 0;
for(int i = 0; str[i]; i++){
if(k1 != str[i]){
if(str[i] == 'r')
r1++;
else
b1++;
}
if(k2 != str[i]){
if(str[i] == 'r')
r2++;
else
b2++;
}
k1 = m - k1;
k2 = m - k2;
}
cout << min(max(r1, b1), max(r2, b2)) << endl;
return 0;
}
Codeforces Round #373 (Div. 2)-B. Anatoly and Cockroaches
最新推荐文章于 2017-08-04 10:53:18 发布