Codeforces Round #575 (Div. 3) - D2. RGB Substring (hard version)

最新推荐文章于 2024-07-15 17:55:50 发布

原创

最新推荐文章于 2024-07-15 17:55:50 发布 · 292 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#字符串 #codeforces

给定一个字符串s和整数k，求使s中存在长度为k且为'RGBRGB...'子串的最少修改次数。对于多个查询，输出每个查询的最小修改次数。

原题链接

The only difference between easy and hard versions is the size of the input.

You are given a string s consisting of nn characters, each character is 'R', 'G' or 'B'.

You are also given an integer k. Your task is to change the minimum number of characters in the initial string s so that after the changes there will be a string of length k that is a substring of s, and is also a substring of the infinite string "RGBRGBRGB ...".

A string a is a substring of string b if there exists a positive integer ii such that $a_1 = b_i$ , $a_2 = b_{i + 1}$ , $a_3 = b_{i + 2}$ , ...,

最低0.47元/天解锁文章

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

xtu 2018

关注关注

1
点赞
踩
1

收藏

觉得还不错? 一键收藏
0
评论
分享

复制链接

分享到 QQ

分享到新浪微博

扫一扫
举报

举报

Codeforces Round 1030 (Div. 2)-D2. Red Light, Green Light (Hard version)题解

06-17

在Codeforces平台上，有一道名为"Red Light, Green Light (Hard version)"的题目，它是为Div. 2竞赛中的参与者准备的高级版本。这个问题要求参赛者编写一个算法来解决一个特定的编程挑战。问题的具体细节并未在给定...

Codeforces Round #629 (Div. 3) E – Tree Queries dfs序判祖先关系

01-20

标题中的"Codeforces Round #629 (Div. 3) E – Tree Queries dfs序判祖先关系"指的是一场编程竞赛中的问题，涉及到树结构的查询和深度优先搜索（DFS）来判断节点间的祖先关系。这个问题的目标是设计算法来确定在...

参与评论您还未登录，请先登录后发表或查看评论

Codeforces Round #575 (Div. 3)

weixin_30908941的博客

07-27

191

B. Odd Sum Segments time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output You are given an array

Codeforces Round #575 (Div. 3)（ABCD1D2E）

starlet_kiss的博客

08-13

418

Three Piles of Candies CodeForces - 1196A Alice and Bob have received three big piles of candies as a gift. Now they want to divide these candies as fair as possible. To do this, Alice takes one pile ...

codeForces #575 div3 D - RGB Substring (easy version)

suixin322的博客

11-15

303

The only difference between easy and hard versions is the size of the input. You are given a string s consisting of n characters, each character is ‘R’, ‘G’ or ‘B’. You are also given an integer k. Yo...

575 div3RGB Substring (hard version)——思维-

T_T233333333的博客

08-02

182

【题目描述】 The only difference between easy and hard versions is the size of the input. You are given a string s consisting of n characters, each character is ‘R’, ‘G’ or ‘B’. You are also given an intege...

Codeforces Round #787 (Div. 3)个人题解

weixin_51767904的博客

05-06

1320

Codeforces Round #787 (Div. 3)个人题解 Codeforces Round #787 (Div. 3) A. Food for Animals B. Make It Increasing C. Detective Task D. Vertical Paths E. Replace With the Previous, Minimize F. Vlad and Unfinished Business G. Sorting Pancakes

Codeforces Round #956 (Div. 2) and ByteRace 2024

最新发布

HKUST_ZJH的博客

07-15

1323

Codeforces Round #956 (Div. 2) and ByteRace 2024

XTU online judge 1266 RGB

jingyibuok的博客

11-07

1632

Description 你有r颗红球，g颗绿球，b颗蓝球，它们排成一个直线。你想它们按红绿蓝顺序分成三个颜色区域，你每次可以任意交换两个球的位置，请问至少需要交换多少次？ Input 每行输入一个字符串表示开始时球的序列，使用RGB分别表示红绿蓝三色球，字符串长度不超过10000。 Output 每行输出一个样例的结果。 Sample Input RRGGBB RGBRGB Sample Output 0 2 解题思路：统计R,G,B的出现次数，在0…R-1统计G,B的出现次数，记为R1,R2，在R…R+

2017湘潭赛XTU1266Parentheses

要做ADC

07-12

581

Parentheses Accepted : 44 Submit : 109 Time Limit : 3000 MS Memory Limit : 65536 KB Parentheses Bobo has a very long sequence divided into n consecutive gro

F1. Pictures with Kittens (easy version)【暴力】

lml11111的博客

11-18

1156

题目链接 F1. Pictures with Kittens (easy version) time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output The only difference between easy a...

cf 575 D1. RGB Substring (easy version)

m0_43449107的博客

11-06

271

Equalizing by Division (easy version)

茗少的博客

09-05

892

题目描述: The only difference between easy and hard versions is the number of elements in the array. You are given an arrayaaconsisting ofnnintegers. In one move you can choose anyaiaiand divide i...

C2. Exam in BerSU (hard version)

蒟蒻小胖

06-22

645

The only difference between easy and hard versions is constraints. If you write a solution in Python, then prefer to send it in PyPy to speed up execution time. A session has begun at Beland State U...

D2. Remove the Substring

qq_36102055的博客

01-24

295

D2. Remove the Substring (hard version) The only difference between easy and hard versions is the length of the string. You are given a string s and a string t, both consisting only of lowercase Latin...

RGB Substring (hard version)

C_Dreamy的博客

03-10

467

The only difference between easy and hard versions is the size of the input. You are given a string s consisting of n characters, each character is 'R', 'G' or 'B'. You are also given an intege...

D2. Too Many Segments (hard version)

caowenbo2311694605的博客

10-25

1192

D2. Too Many Segments (hard version) time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output The only difference between easy and hard ve...

Codeforces Round #575 (Div. 3) D1. RGB Substring (easy version)

绝尘

07-31

518

D1. RGB Substring (easy version) time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output The only difference between easy and hard versions is the s...

1213D2-按分区均衡化(硬体版本)

weixin_44705665的博客

09-02

240

The only difference between easy and hard versions is the number of elements in the array. You are given an arrayaaconsisting ofnnintegers. In one move you can choose anyaiaiand divide it by22...