zoukankan      html  css  js  c++  java
  • B. Anatoly and Cockroaches

    B. Anatoly and Cockroaches
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Anatoly lives in the university dorm as many other students do. As you know, cockroaches are also living there together with students. Cockroaches might be of two colors: black and red. There are n cockroaches living in Anatoly's room.

    Anatoly just made all his cockroaches to form a single line. As he is a perfectionist, he would like the colors of cockroaches in the line to alternate. He has a can of black paint and a can of red paint. In one turn he can either swap any two cockroaches, or take any single cockroach and change it's color.

    Help Anatoly find out the minimum number of turns he needs to make the colors of cockroaches in the line alternate.

    Input

    The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of cockroaches.

    The second line contains a string of length n, consisting of characters 'b' and 'r' that denote black cockroach and red cockroach respectively.

    Output

    Print one integer — the minimum number of moves Anatoly has to perform in order to make the colors of cockroaches in the line to alternate.

    Examples
    input
    5
    rbbrr
    output
    1
    input
    5
    bbbbb
    output
    2
    input
    3
    rbr
    output
    0
    Note

    In the first sample, Anatoly has to swap third and fourth cockroaches. He needs 1 turn to do this.

    In the second sample, the optimum answer is to paint the second and the fourth cockroaches red. This requires 2 turns.

    In the third sample, the colors of cockroaches in the line are alternating already, thus the answer is 0.

    这么道水题。。。我居然花了半个小时。。。果然我还是太弱了

     1 #include<iostream>
     2 #include<cstring>
     3 using namespace std;
     4 
     5 int n,cntr=0,cntb=0,ans=0x7fffffff;
     6 char s[100001];
     7 
     8 int main()
     9 {
    10     cin>>n>>s;
    11     for(int i=0;i<n;i++)
    12     {
    13         if(s[i]=='r'&&i&1) cntr++;
    14         if(s[i]=='b'&&!(i&1)) cntb++;
    15     }
    16     ans=min(ans,max(cntr,cntb));
    17     cntr=cntb=0;
    18     for(int i=0;i<n;i++)
    19     {
    20         if(s[i]=='b'&&i&1) cntr++;
    21         if(s[i]=='r'&&!(i&1)) cntb++;
    22     }
    23     ans=min(ans,max(cntr,cntb));
    24     cout<<ans<<endl;
    25     return 0;
    26 }
  • 相关阅读:
    UESTC--1727
    css3制作左右拉伸动画菜单
    Mysql主从数据库(master/slave),实现读写分离
    阿里云Centos7.6上面部署基于redis的分布式爬虫scrapy-redis将任务队列push进redis
    利用基于Go Lang的Hugo配合nginx来打造属于自己的纯静态博客系统
    Centos7.6上利用docker搭建Jenkins来自动化部署Django项目
    使用基于Vue.js和Hbuilder的混合模式移动开发打造属于自己的移动app
    Centos7.6上部署Supervisor来监控和操作各类服务
    Centos上配置nginx+uwsgi+负载均衡配置
    Websocket---认识篇
  • 原文地址:https://www.cnblogs.com/InWILL/p/5903038.html
Copyright © 2011-2022 走看看