Codeforce962B(暴力)

最新推荐文章于 2024-07-28 15:51:28 发布

原创最新推荐文章于 2024-07-28 15:51:28 发布 · 293 阅读

0 ·

CC 4.0 BY-SA版权

思维专栏收录该内容

22 篇文章

订阅专栏

探讨如何在有限的火车车厢座位中，最优化地安排学生程序员与运动员的座位，确保相邻座位不坐同一类型的学生。

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);

}

}

“`