2017年9月12日
The Largest Clique UVA - 11324
摘要： 题文：https://vjudge.net/problem/UVA-11324 题解： 这个题目首先可以发现，只要是一个强连通分量，要么都选，要么都不选，将点权看成强连通分量的点数，所以这个题目就转化成了DAG上的最大路。 稍微dp一下就好了。 代码： 阅读全文
posted @ 2017-09-12 22:22 人间失格—太宰治 阅读(247) 评论(0) 推荐(0)
Dollar Dayz POJ - 3181
摘要： Farmer John goes to Dollar Days at The Cow Store and discovers an unlimited number of tools on sale. During his first visit, the tools are selling var 阅读全文
posted @ 2017-09-12 16:22 人间失格—太宰治 阅读(141) 评论(0) 推荐(0)
Cheapest Palindrome POJ - 3280
摘要： Keeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow an electronic ID 阅读全文
posted @ 2017-09-12 15:59 人间失格—太宰治 阅读(245) 评论(0) 推荐(0)
Cow Acrobats
摘要： Farmer John's N (1 <= N <= 50,000) cows (numbered 1..N) are planning to run away and join the circus. Their hoofed feet prevent them from tightrope wa 阅读全文
posted @ 2017-09-12 12:05 人间失格—太宰治 阅读(425) 评论(0) 推荐(2)
The Troublesome Frog
摘要： In Korea, the naughtiness of the cheonggaeguri, a small frog, is legendary. This is a well-deserved reputation, because the frogs jump through your ri 阅读全文
posted @ 2017-09-12 11:17 人间失格—太宰治 阅读(388) 评论(0) 推荐(0)