08 2019 档案

CodeForce Round 578 Div 2 E. Compress Words
摘要："E. Compress Words" Problem Amugae has a sentence consisting of $n$ words. He want to compress this sentence into one word. Amugae doesn't like repeti 阅读全文
posted @ 2019-08-15 09:44 ChenShou 阅读(435) 评论(0) 推荐(0)
CodeForce Round 578 Div 2 D. White Lines
摘要：D. "White Lines" Problem Gildong has bought a famous painting software cfpaint. The working screen of cfpaint is square shaped consisting of $n$ rows 阅读全文
posted @ 2019-08-15 09:43 ChenShou 阅读(2713) 评论(0) 推荐(0)
CodeForce Round 578 Div 2 C. Round Corridor
摘要："C. Round Corridor" Problem Amugae is in a very large round corridor. The corridor consists of two areas. The inner area is equally divided by $n$ sec 阅读全文
posted @ 2019-08-15 09:40 ChenShou 阅读(342) 评论(0) 推荐(0)
Codeforce Round 578 Div. 2 B. Block Adventure
摘要："B. Block Adventure" Problem Gildong is playing a video game called Block Adventure. In Block Adventure, there are n columns of blocks in a row, and t 阅读全文
posted @ 2019-08-15 09:39 ChenShou 阅读(389) 评论(0) 推荐(0)
Codeforce Round 578 Div. 2 A. Hotelier
摘要："A. Hotelier" Problem Amugae has a hotel consisting of $10$ rooms. The rooms are numbered from $0$ to $9$ from left to right. The hotel has two entran 阅读全文
posted @ 2019-08-15 09:38 ChenShou 阅读(557) 评论(0) 推荐(0)
线段树和主席树
摘要：title: 线段树相关 date: 2019 07 30 15:23:00 tags: [undone] mathjax: true toc: true 线段树是一种神奇的数据结构，能将区间数据多次修改与多次求和的复杂度降低,而且它还有升级版 <! more 线段树 (I) 产生背景 假设我们有$ 阅读全文
posted @ 2019-08-04 16:53 ChenShou 阅读(469) 评论(0) 推荐(0)
关于GCD
摘要：GCD作为缩写意义有多种。它通常表示多核编程的解决方法，也有最大公约数（greatest common divisor，简写为gcd；或highest common factor，简写为hcf），此外它还是什么共什么产什么党什么的拼音缩写和游戏《鬼吹灯外传》的拼音缩写和“创意群总监”的英文缩写。在这 阅读全文
posted @ 2019-08-01 10:06 ChenShou 阅读(1767) 评论(0) 推荐(0)