# Codeforces 933 C. A Colourful Prospect （平面图，欧拉公式）

Description Firecrackers scare Nian the monster, but they’re wayyyyy too noisy! Maybe fireworks make a nice complement. Little Tommy is watc...

# Codeforces 933 B. A Determined Cleanup（数学）

Description In order to put away old things and welcome a fresh new year, a thorough cleaning of the house is a must. Little Tommy finds an ...

# Codeforces 933 A. A Twisty Movement （dp）

Description A dragon symbolizes wisdom, power and wealth. On Lunar New Year’s Day, people model a dragon with bamboo strips and clothes, raise th...

# Codeforces 834 D. The Bakery （线段树+dp）

Description Some time ago Slastyona the Sweetmaid decided to open her own bakery! She bought required ingredients and a wonder-oven which c...

# Codeforces 845 C. Two TVs （模拟）

Description Polycarp is a great fan of television. He wrote down all the TV programs he is interested in for today. His list contains n show...

# Codeforces 845 D. Driving Test （模拟）

Description Polycarp has just attempted to pass the driving test. He ran over the straight road with the signs of four types. speed limit...

# Codeforces 844 D. Interactive LowerBound （随机）

Description This is an interactive problem. You are given a sorted in increasing order singly linked list. You should find the minimum integ...

# Codeforces 844 C. Sorting by Subsequences （循环节）

Description You are given a sequence a1, a2, …, an consisting of different integers. It is required to split this sequence into the maximum numbe...

# Codeforces 763 A. Timofey and a tree （dfs）

Description Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, ...

# Codeforces 292 D. Connected Components （并查集）

Description We already know of the large corporation where Polycarpus works as a system administrator. The computer network there consists of n c...

# Codeforces 292 E. Copying Data （线段树）

Description We often have to copy large volumes of information. Such operation can take up many computer resources. Therefore, in this problem yo...

# Codeforces 920 E. Connected Components? （bfs）

Description You are given an undirected graph consisting of n vertices and n(n&#x2212;1)2&#x2212;m" role="presentation">...

# Codeforces 919 D. Substring （记忆化搜索）

Description You are given a graph with n nodes and m directed edges. One lowercase letter is assigned to each node. We define a path’s value as t...

个人资料
等级：
访问量： 36万+
积分： 1万+
排名： 2019
欢迎关注 <千与梦随> 哦！
博客专栏
 那些年,我们一起追过的算法 文章：6篇 阅读：23920
最新评论