[Training]CCPC2018-湖南全国邀请赛

Posted 2021-01-04 amadeus

Rank	Solved	A	B	C	D	E	F	G	H	I	J	K
--/--	8/11	O	O	O	.	O	O	O	.	.	O	O

O: 当场通过

?: 赛后通过

.: 尚未通过

A Easy h-index

solved by chelly

---

chelly‘s solution

签到

B Higher h-index

solved by chelly&ch

---

chelly‘s solution

最优策略是分成n个部分，每个都是1

C Just h-index

solved by chelly

---

chelly‘s solution

在可持久化线段树上二分

D Circular Coloring

unsolved

---

E From Tree to Graph

solved by chelly

---

chelly‘s solution

容易发现对于一个树上一个点来说，它的答案就是它的度数
考虑每次加入一条边，就是把环上的点答案-1
用并查集维护

F Sorting

solved by ch

---

ch‘s solution

排个序，注意用__int128

G String Transformation

solved by ch

---

ch‘s solution

H Infinity

unsolved

---

I Longest Increasing Subsequence

unsolved

---

J Vertex Cover

solved by ch

---

ch‘s solution

K 2018

solved by ch

---

ch‘s solution

Replay

本场由chelly、ch线下打的。
chelly：日常不在状态，各种卡题，读假题。