Codeforce962B(暴力)

Students in Railway Carriage

There are
n
n
consecutive seat places in a railway carriage. Each place is either empty or occupied by a passenger.
The university team for the Olympiad consists of
a
a
student-programmers and
b
b
student-athletes. Determine the largest number of students from all
a
+
b
a+b
students, which you can put in the railway carriage so that:
no student-programmer is sitting next to the student-programmer;
and no student-athlete is sitting next to the student-athlete.
In the other words, there should not be two consecutive (adjacent) places where two student-athletes or two student-programmers are sitting.
Consider that initially occupied seat places are occupied by jury members (who obviously are not students at all).
Input
The first line contain three integers
— total number of seat places in the railway carriage, the number of student-programmers and the number of student-athletes.
The second line contains a string with length
n
n
, consisting of characters “.” and “*”. The dot means that the corresponding place is empty. The asterisk means that the corresponding place is occupied by the jury member.
Output
Print the largest number of students, which you can put in the railway carriage so that no student-programmer is sitting next to a student-programmer and no student-athlete is sitting next to a student-athlete.ext.*;
import java.io.*;

public class Main{
public static void main(String[] args){
Scanner cin=new Scanner(System.in);

    int n,a,b;
    String s;

    int ans=0;
    n=cin.nextInt();
    a=cin.nextInt();
    b=cin.nextInt();
    s=cin.next();
    //System.out.println(s);
    int sum=a+b;
    String[] array=s.split("\\*");
    int cnt=array.length;
    for(int i=0;i<cnt;i++){
        if(a<=0&&b<=0)  break;
        if(array[i].length()==0)    continue;
        int temp=array[i].length();
        int t=Math.min(a,b);
        if(temp%2==0){
            a-=temp/2;
            b-=temp/2;
        }
        else{
            if(a>b){
                a-=temp/2+1;
                b-=temp/2;
            }
            else{
                b-=temp/2+1;
                a-=temp/2;
            }
        }
    }
    if(a<=0)    a=0;
    if(b<=0)    b=0;
    //System.out.println(a+" "+b);
    if(a==0&&b==0)  System.out.println(sum);
    else    System.out.println(sum-a-b);

}

}

“`

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值