随笔分类 -  字符串

1196D2 - RGB Substring (hard version)
摘要：1196D2 - RGB Substring (hard version) #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #in 阅读全文
posted @ 2020-07-24 10:50 DeaL57 阅读(126) 评论(0) 推荐(0)
C - Power Strings KMP
摘要：C - Power Strings #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include 阅读全文
posted @ 2020-07-21 17:39 DeaL57 阅读(132) 评论(0) 推荐(0)
POJ 3974 马拉车
摘要：POJ 3974 #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream 阅读全文
posted @ 2020-07-21 10:53 DeaL57 阅读(143) 评论(0) 推荐(0)
F. Spy-string
摘要：You are given nn strings a1,a2,…,ana1,a2,…,an: all of them have the same length mm. The strings consist of lowercase English letters. Find any string  阅读全文
posted @ 2020-06-23 21:06 DeaL57 阅读(172) 评论(0) 推荐(0)
D. Task On The Board
摘要：Polycarp wrote on the board a string ss containing only lowercase Latin letters ('a'-'z'). This string is known for you and given in the input. After 阅读全文
posted @ 2020-06-22 12:11 DeaL57 阅读(252) 评论(0) 推荐(0)
F - LCS
摘要：Problem Statement You are given strings ss and tt. Find one longest string that is a subsequence of both ss and tt. Notes A subsequence of a string xx 阅读全文
posted @ 2020-06-16 12:29 DeaL57 阅读(183) 评论(0) 推荐(0)
C. Cow and Message
摘要：Bessie the cow has just intercepted a text that Farmer John sent to Burger Queen! However, Bessie is sure that there is a secret message hidden inside 阅读全文
posted @ 2020-05-26 09:05 DeaL57 阅读(215) 评论(0) 推荐(0)
C. Perfect Keyboard
摘要：Polycarp wants to assemble his own keyboard. Layouts with multiple rows are too complicated for him — his keyboard will consist of only one row, where 阅读全文
posted @ 2020-05-22 20:14 DeaL57 阅读(218) 评论(0) 推荐(0)
D1. Prefix-Suffix Palindrome (Easy version)
摘要：This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make 阅读全文
posted @ 2020-05-19 23:19 DeaL57 阅读(283) 评论(0) 推荐(0)
F. Binary String Reconstruction
摘要：For some binary string ss (i.e. each character sisi is either '0' or '1'), all pairs of consecutive (adjacent) characters were written. In other words 阅读全文
posted @ 2020-05-15 12:10 DeaL57 阅读(278) 评论(0) 推荐(0)
C. Phoenix and Distribution
摘要：Phoenix has a string ss consisting of lowercase Latin letters. He wants to distribute all the letters of his string into kk non-empty strings a1,a2,…, 阅读全文
posted @ 2020-05-06 16:59 DeaL57 阅读(226) 评论(0) 推荐(0)
A. Cut and Paste
摘要：We start with a string ss consisting only of the digits 11, 22, or 33. The length of ss is denoted by |s||s|. For each ii from 11 to |s||s|, the ii-th 阅读全文
posted @ 2020-05-05 17:24 DeaL57 阅读(126) 评论(0) 推荐(0)
B. Azamon Web Services
摘要：Your friend Jeff Zebos has been trying to run his new online company, but it's not going very well. He's not getting a lot of sales on his website whi 阅读全文
posted @ 2020-05-05 16:18 DeaL57 阅读(181) 评论(0) 推荐(0)
B. Infinite Prefixes
摘要：You are given string ss of length nn consisting of 0-s and 1-s. You build an infinite string tt as a concatenation of an infinite number of strings ss 阅读全文
posted @ 2020-04-26 22:24 DeaL57 阅读(147) 评论(0) 推荐(0)
C. Obtain The String
摘要：You are given two strings ss and tt consisting of lowercase Latin letters. Also you have a string zz which is initially empty. You want string zz to b 阅读全文
posted @ 2020-04-26 12:48 DeaL57 阅读(212) 评论(0) 推荐(0)
C. Remove Adjacent
摘要：You are given a string ss consisting of lowercase Latin letters. Let the length of ss be |s||s|. You may perform several operations on this string. In 阅读全文
posted @ 2020-04-23 22:07 DeaL57 阅读(175) 评论(0) 推荐(0)