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)