茄子Min

2019年9月12日

C - Covered Points Count CodeForces - 1000C （差分，离散化，统计）

摘要： "C Covered Points Count" "CodeForces 1000C " You are given nn segments on a coordinate line; each endpoint of every segment has integer coordinates. S 阅读全文

posted @ 2019-09-12 16:30 茄子Min 阅读(361) 评论(0) 推荐(0)

D - Yet Another Problem On a Subsequence CodeForces - 1000D （DP，组合数学）

摘要： "D Yet Another Problem On a Subsequence" "CodeForces 1000D " The sequence of integers a1,a2,…,aka1,a2,…,ak is called a good array if a1=k−1a1=k−1 and 阅读全文

posted @ 2019-09-12 15:22 茄子Min 阅读(305) 评论(0) 推荐(0)

E - We Need More Bosses CodeForces - 1000E （tarjan缩点，树的直径）

摘要： "E We Need More Bosses" "CodeForces 1000E " Your friend is developing a computer game. He has already decided how the game world should look like — it 阅读全文

posted @ 2019-09-12 15:06 茄子Min 阅读(206) 评论(0) 推荐(0)

F - One Occurrence CodeForces - 1000F （线段树+离线处理）

摘要： You are given an array aa consisting of nn integers, and qq queries to it. ii th query is denoted by two integers lili and riri. For each query, you h 阅读全文

posted @ 2019-09-12 14:47 茄子Min 阅读(255) 评论(0) 推荐(0)

2019年9月11日

Almost Regular Bracket Sequence CodeForces - 1095E （线段树，单点更新，区间查询维护括号序列）

摘要： Almost Regular Bracket Sequence "CodeForces 1095E " You are given a bracket sequence ss consisting of nn opening '(' and closing ')' brackets. A regul 阅读全文

posted @ 2019-09-11 00:56 茄子Min 阅读(375) 评论(0) 推荐(0)

2019年9月9日

Successor HDU - 4366 （预处理，线段树，dfs序）

摘要： Successor "HDU 4366 " Sean owns a company and he is the BOSS.The other Staff has one Superior.every staff has a loyalty and ability.Some times Sean wi 阅读全文

posted @ 2019-09-09 22:35 茄子Min 阅读(250) 评论(0) 推荐(0)

Sereja and Brackets CodeForces - 380C （树状数组+离线）

摘要： Sereja and Brackets 题目链接： "CodeForces 380C " Sereja has a bracket sequence s 1, s 2, ..., s n , or, in other words, a string s of length n , consistin 阅读全文

posted @ 2019-09-09 15:32 茄子Min 阅读(161) 评论(0) 推荐(0)

Sereja and Brackets CodeForces - 380C （线段树+分治思路）

摘要： Sereja and Brackets 题目链接： "CodeForces 380C " Sereja has a bracket sequence s 1, s 2, ..., s n , or, in other words, a string s of length n , consistin 阅读全文

posted @ 2019-09-09 14:29 茄子Min 阅读(290) 评论(0) 推荐(0)

“美登杯”上海市高校大学生程序设计 C. 小花梨判连通 (并查集+map)

摘要： Problem C C 、小花梨判连通时间限制：2000ms 空间限制：512MB Description 小花梨给出𝑜个点，让𝑙位同学对这𝑜个点任意添加无向边，构成𝑙张图。小花梨想知道对于每个点𝑗，存在多少个点𝑘（包括𝑗本身），使得𝑗和𝑘在这𝑙张图中都是连通的。 In 阅读全文

posted @ 2019-09-09 13:11 茄子Min 阅读(284) 评论(1) 推荐(0)

2019年9月7日

The Preliminary Contest for ICPC Asia Nanjing 2019 B. super_log （广义欧拉降幂）

摘要： In Complexity theory, some functions are nearly O(1) O (1), but it is greater then O(1) O (1). For example, the complexity of a typical disjoint set i 阅读全文

posted @ 2019-09-07 00:33 茄子Min 阅读(209) 评论(0) 推荐(0)

起舞弄清影，何似在人间。

公告