C - Queue at the School
Problem description
During the break the schoolchildren, boys and girls, formed a queue of n people in the canteen. Initially the children stood in the order they entered the canteen. However, after a while the boys started feeling awkward for standing in front of the girls in the queue and they started letting the girls move forward each second.
Let's describe the process more precisely. Let's say that the positions in the queue are sequentially numbered by integers from 1 to n, at that the person in the position number 1 is served first. Then, if at time x a boy stands on the i-th position and a girl stands on the (i + 1)-th position, then at time x + 1 the i-th position will have a girl and the (i + 1)-th position will have a boy. The time is given in seconds.
You've got the initial position of the children, at the initial moment of time. Determine the way the queue is going to look after t seconds.
Input
The first line contains two integers n and t (1 ≤ n, t ≤ 50), which represent the number of children in the queue and the time after which the queue will transform into the arrangement you need to find.
The next line contains string s, which represents the schoolchildren's initial arrangement. If the i-th position in the queue contains a boy, then the i-th character of string s equals "B", otherwise the i-th character equals "G".
Output
Print string a, which describes the arrangement after t seconds. If the i-th position has a boy after the needed time, then the i-th character a must equal "B", otherwise it must equal "G".
Examples
Input
5 1
BGGBG
Output
GBGGB
Input
5 2
BGGBG
Output
GGBGB
Input
4 1
GGGB
Output
GGGB
解题思路:题目的意思就是输入一个字符串(只由'B'和'G'两个字符组成)和变换时间t秒。要求每秒都将当前的字符串中这两个连续的字符'B'(在前)'G'(在后)交换位置,注意每秒中每个字符至多变换1次,水过!
AC代码:
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,t;char s[];
cin>>n>>t;getchar();
cin>>s;
for(int i=;i<=t;++i)//变换时间t秒
for(int j=;s[j]!='\0';++j)//注意每秒中每个字符至多变换1次位置
if((s[j-]=='B')&&(s[j]=='G')){swap(s[j-],s[j]);j++;}//j++是跳过已变换的字符,避免变换两次或多次
cout<<s<<endl;
return ;
}
最新文章
- gulp复制整个文件夹或文件到指定目录(包括拷贝单个文件)
- Java_Java中动态加载jar文件和class文件
- 关于JS一些验证邮箱的一些问题
- 【Unity】13.3 Realtime GI示例
- R语言的日期运算
- python FTP上传和下载文件
- 规范打log
- 函数执行到return就结束了
- javascript知识图谱
- LINQ简明教程:数据排序、分组、过滤
- 设计模式--静态工厂设计模式在android中的使用
- Mysql 锁机制
- 微信小程序之----组件
- 基于laravel5.4 vue 和vue-element搭建的单页面后台CMS
- 20162330 第三周 蓝墨云班课 泛型类-Bag 练习
- 不要在#include中使用";..";
- python_类与对象学习笔记
- 关于Vue(旅游APP)的一些总结点
- codeforces 1066 B heater
- datetime.timedelta类