摘要:
Split The Tree 题目描述 You are given a tree with n vertices, numbered from 1 to n. ith vertex has a value wiWe define the weight of a tree as the number 阅读全文
摘要:
牛的舞会The Cow Prom 牛的舞会The Cow Prom 牛的舞会The Cow Prom 时空限制1000ms / 128MB 题目描述 The N (2 <= N <= 10,000) cows are so excited: it's prom night! They are dre 阅读全文
摘要:
餐巾计划问题 餐巾计划问题 餐巾计划问题 时空限制4000ms / 128MB 题目描述 一个餐厅在相继的 N 天里,每天需用的餐巾数不尽相同。假设第 i 天需要 ri块餐巾( i=1,2,...,N)。餐厅可以购买新的餐巾,每块餐巾的费用为 p 分;或者把旧餐巾送到快洗部,洗一块需 m 天,其费 阅读全文
摘要:
Hubtown 题目描述 Hubtown is a large Nordic city which is home to n citizens. Every morning, each of its citizens wants to travel to the central hub from w 阅读全文
摘要:
Annual Congress of MUD 题目描述 Multiuser dungeon games, also called MUD games, are real-time virtual-world multiplayer games that are usually played onli 阅读全文
摘要:
数字梯形问题 数字梯形问题 数字梯形问题 题目描述 给定一个由 n 行数字组成的数字梯形如下图所示。 梯形的第一行有 m 个数字。从梯形的顶部的 m 个数字开始,在每个数字处可以沿左下或右下方向移动,形成一条从梯形的顶至底的路径。 分别遵守以下规则: 从梯形的顶至底的 m 条路径互不相交; 从梯形的 阅读全文