【ACM字符串】
qq_36424540
这个作者很懒,什么都没留下…
展开
-
Spy Syndrome 2 CodeForces - 633C
After observing the results of Spy Syndrome, Yash realised the errors of his ways. He now believes that a super spy such as Siddhant can't use a cipher as basic and ancient as Caesar cipher. After man...原创 2018-04-07 10:52:12 · 242 阅读 · 0 评论 -
Skr(马拉车+哈希)
A number is skr, if and only if it's unchanged after being reversed. For example, "12321", "11" and "1" are skr numbers, but "123", "221" are not. FYW has a string of numbers, each substring can prese...原创 2018-09-22 21:17:42 · 332 阅读 · 0 评论 -
#1829 : Tomb Raider(哈希)
描述Lara Croft, the fiercely independent daughter of a missing adventurer, must push herself beyond her limits when she discovers the island where her father disappeared. In this mysterious island, La...原创 2018-09-22 21:15:50 · 223 阅读 · 0 评论 -
String and Times
Now you have a string consists of uppercase letters, two integers AAA and BBB. We call a substring wonderful substring when the times it appears in that string is between AAA and BBB (A≤times≤BA \le t...原创 2018-09-16 21:01:42 · 261 阅读 · 0 评论 -
Boring String Problem
Problem DescriptionIn this problem, you are given a string s and q queries.For each query, you should answer that when all distinct substrings of string s were sorted lexicographically, which one i...原创 2018-09-08 21:21:23 · 245 阅读 · 0 评论 -
B. Segment Occurrences
You are given two strings s and t, both consisting only of lowercase Latin letters.The substring s[l..r]is the string which is obtained by taking characters sl,sl+1,…,srwithout changing the or...原创 2018-08-17 15:11:31 · 471 阅读 · 0 评论 -
Typing practice
链接:https://www.nowcoder.com/acm/contest/147/F来源:牛客网 题目描述Niuniu is practicing typing.Given n words, Niuniu want to input one of these. He wants to input (at the end) as few characters (without b...原创 2018-08-17 14:11:58 · 2691 阅读 · 0 评论 -
Hills And Valleys
Problem DescriptionTauren has an integer sequence A of length n (1-based). He wants you to invert an interval [l,r] (1≤l≤r≤n) of A (i.e. replace Al,Al+1,⋯,Ar with Ar,Ar−1,⋯,Al) to maximize the lengt...原创 2018-08-08 21:38:20 · 291 阅读 · 0 评论 -
Xor Sum HDU - 4825
Zeus 和 Prometheus 做了一个游戏,Prometheus 给 Zeus 一个集合,集合中包含了N个正整数,随后 Prometheus 将向 Zeus 发起M次询问,每次询问中包含一个正整数 S ,之后 Zeus 需要在集合当中找出一个正整数 K ,使得 K 与 S 的异或结果最大。Prometheus 为了让 Zeus 看到人类的伟大,随即同意 Zeus 可以向人类求助。你能证明...原创 2018-04-04 20:53:41 · 320 阅读 · 0 评论 -
String HDU - 4821
Given a string S and two integers L and M, we consider a substring of S as “recoverable” if and only if (i) It is of length M*L; (ii) It can be constructed by concatenating M “diversified” substri...原创 2018-10-29 15:28:57 · 130 阅读 · 0 评论