2017年2月15日

HDU 3452 Bonsai（树形dp）

摘要： Bonsai Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description After being assaulted in the parking lot by Mr. Miyagi following t 阅读全文

posted @ 2017-02-15 16:53 Yxter 阅读(233) 评论(0) 推荐(0) 编辑

zoj 3212 K-Nice（构造）

摘要： This is a super simple problem. The description is simple, the solution is simple. If you believe so, just read it on. Or if you don't, just pretend t 阅读全文

posted @ 2017-02-15 14:08 Yxter 阅读(272) 评论(0) 推荐(0) 编辑

ZOJ 3211 Dream City(线性DP)

摘要： JAVAMAN is visiting Dream City and he sees a yard of gold coin trees. There are n trees in the yard. Let's call them tree 1, tree 2 ...and tree n. At 阅读全文

posted @ 2017-02-15 14:05 Yxter 阅读(246) 评论(0) 推荐(0) 编辑

ZOJ 3207 80ers' Memory（strcmp函数的用法）

摘要： I guess most of us are so called 80ers, which means that we were born in the 1980's. This group of people shared a lot of common memories. For example 阅读全文

posted @ 2017-02-15 14:00 Yxter 阅读(246) 评论(0) 推荐(0) 编辑

ZOJ 3203 Light Bulb（数学对勾函数）

摘要： Compared to wildleopard's wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in his house. Every 阅读全文

posted @ 2017-02-15 13:57 Yxter 阅读(566) 评论(0) 推荐(0) 编辑

ZOJ 3204 Connect them（最小生成树+最小字典序）

摘要： You have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections are two-way (that is 阅读全文

posted @ 2017-02-15 13:53 Yxter 阅读(317) 评论(0) 推荐(0) 编辑

导航