摘要:
有点像计蒜之道里的 京东的物流路径 题目描述 给定一棵 N 个节点的树,每个节点有一个正整数权值。记节点 i 的权值为 Ai。考虑节点 u 和 v 之间的一条简单路径,记 dist(u, v) 为其长度,gcd(u, v) 为路径上所有节点(包含 u 和 v)的权值的最大公因子。min(u, v) 阅读全文
摘要:
需要稍加分析结论;还有一些小细节 Arseny likes to organize parties and invite people to it. However, not only friends come to his parties, but friends of his friends, 阅读全文
摘要:
过程很美妙啊 Problem Description Rikka is a high school girl suffering seriously from Chūnibyō (the age of fourteen would either act like a know-it-all adul 阅读全文
摘要:
思路自然的巧妙dp Description 有N头奶牛,每头那牛都有一个标号Pi,1 <= Pi <= M <= N <= 40000。现在Farmer John要把这些奶牛分成若干段,定义每段的不河蟹度为:若这段里有k个不同的数,那不河蟹度为k*k。那总的不河蟹度就是所有段的不河蟹度的总和。 有N 阅读全文
摘要:
比较经典的差分约束 Description A supermarket in Tehran is open 24 hours a day every day and needs a number of cashiers to fit its need. The supermarket manager 阅读全文