摘要: byl太强了,学弟们太强了~全程被吊打,嘤嘤嘤~ A题 Connecting Vertices http://codeforces.com/problemset/problem/888/F 不会 B题 Local Extrema http://codeforces.com/problemset/pr 阅读全文
posted @ 2019-09-22 22:04 友人-A 阅读(404) 评论(0) 推荐(0) 编辑
摘要: After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their competitions 阅读全文
posted @ 2019-09-22 21:40 友人-A 阅读(391) 评论(0) 推荐(0) 编辑
摘要: Vasya is an administrator of a public page of organization "Mouse and keyboard" and his everyday duty is to publish news from the world of competitive 阅读全文
posted @ 2019-09-22 21:20 友人-A 阅读(476) 评论(0) 推荐(0) 编辑
摘要: During the lesson small girl Alyona works with one famous spreadsheet computer program and learns how to edit tables. Now she has a table filled with 阅读全文
posted @ 2019-09-22 21:06 友人-A 阅读(329) 评论(0) 推荐(0) 编辑
摘要: A permutation $p$ of size $n$ is an array such that every integer from $1$ to $n$ occurs exactly once in this array. Let's call a permutation an almos 阅读全文
posted @ 2019-09-22 20:46 友人-A 阅读(370) 评论(0) 推荐(0) 编辑
摘要: You are given an array a consisting of n integers, and additionally an integer m . You have to choose some sequence of indices $b_1, b_2, ..., b_k (1  阅读全文
posted @ 2019-09-22 20:28 友人-A 阅读(348) 评论(0) 推荐(0) 编辑
摘要: You are given a string s consisting of lowercase Latin letters. Character c is called k dominant iff each substring of s with length at least k contai 阅读全文
posted @ 2019-09-22 19:52 友人-A 阅读(185) 评论(0) 推荐(0) 编辑