
codeforces
破晓aa
这个作者很懒,什么都没留下…
展开
-
Codeforces 961 D Pair Of Line
You are given n points on Cartesian plane. Every point is a lattice point (i. e. both of its coordinates are integers), and all points are distinct. You may draw two straight lines (not necessarily d...原创 2018-11-12 09:24:25 · 153 阅读 · 0 评论 -
Preparing for Merge Sort CodeForces - 847B (二分)
Ivan has an array consisting of n different integers. He decided to reorder all elements in increasing order. Ivan loves merge sort so he decided to represent his array with one or several increasing ...原创 2018-12-04 08:19:13 · 174 阅读 · 0 评论 -
Codeforces Round #527 (Div. 3) F. Tree with Maximum Cost (树形dp)
You are given a tree consisting exactly of原创 2018-12-20 10:59:40 · 270 阅读 · 0 评论 -
Easy Problem(Educational Codeforces Round 57 (Rated for Div. 2) ) (dp)
Vasya is preparing a contest, and now he has written a statement for an easy problem. The statement is a string of length原创 2019-01-02 08:59:45 · 294 阅读 · 0 评论 -
Codeforces Round #529 (Div. 3) E. Almost Regular Bracket Sequence
You are given a bracket sequence原创 2019-01-02 10:12:46 · 435 阅读 · 0 评论 -
Codeforces Round #523 (Div. 2) C. Multiplicity (dp)
C. Multiplicity time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output You are given an integer array原创 2019-01-02 17:04:22 · 247 阅读 · 0 评论 -
Codeforces Round #531 E. Monotonic Renumeration(思维题)
题目链接 题意: 给出一个a数组,让你构建b数组,要求满足下列条件: b1=0; for every pair of indices i and j such that 1≤i,j≤n, if ai=aj, then bi=bj (note that if ai≠aj, it is still possible that bi=bj); for every index i∈[1,n−1] ei...原创 2019-01-13 15:50:13 · 256 阅读 · 0 评论 -
Codeforces Round #522 C. Playing Piano(dp)
Little Paul wants to learn how to play piano. He already has a melody he wants to start with. For simplicity he represented this melody as a sequence a1,a2,…,ana1,a2,…,an of key numbers: the more a nu...原创 2019-01-08 19:53:17 · 202 阅读 · 1 评论 -
Codeforces Round #531 (Div. 3) D. Balanced Ternary String (思维)
You are given a string s consisting of exactly n characters, and each character is either ‘0’, ‘1’ or ‘2’. Such strings are called ternary strings. Your task is to replace minimum number of characters...原创 2019-01-10 11:27:38 · 382 阅读 · 0 评论