摘要: Problem A A. Key races time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Two boys decided t 阅读全文
posted @ 2017-08-01 20:58 ISGuXing 阅读(176) 评论(0) 推荐(0) 编辑
摘要: Jessica's a very lovely girl wooed by lots of boys. Recently she has a problem. The final exam is coming, yet she has spent little time on it. If she 阅读全文
posted @ 2017-08-01 19:26 ISGuXing 阅读(167) 评论(0) 推荐(0) 编辑
摘要: A Bug's Life Time Limit: 10000MS Memory Limit: 65536K Total Submissions: 38229 Accepted: 12436 Description BackgroundProfessor Hopper is researching t 阅读全文
posted @ 2017-08-01 16:20 ISGuXing 阅读(239) 评论(0) 推荐(0) 编辑
摘要: C. The Meaningless Game time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Slastyona and her 阅读全文
posted @ 2017-07-31 12:19 ISGuXing 阅读(158) 评论(0) 推荐(0) 编辑
摘要: B. The Festive Evening time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output B. The Festive Eve 阅读全文
posted @ 2017-07-31 12:09 ISGuXing 阅读(181) 评论(0) 推荐(0) 编辑
摘要: A. The Useless Toy time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Walking through the st 阅读全文
posted @ 2017-07-31 12:05 ISGuXing 阅读(160) 评论(0) 推荐(0) 编辑
摘要: 题目大意:就是求最长的上升子序列,输出长度。 思路:LIS水题。就是题目描述的特别长。 阅读全文
posted @ 2017-07-30 20:19 ISGuXing 阅读(245) 评论(0) 推荐(0) 编辑
摘要: 题目大意:就是说怎样建道路才使得所建道路最多。任意两天道路不能交叉。 解题思路:因为是按城市按顺序排列。所以我们只需将两个城市序号用结构体存下来。对富人城市排序。 这样就成了一个序列了,这样就成了一个LIS的裸题了。 ps:1、这题目坑的地方在于输出的地方,讲究英语语法。。。如果一条路输出road, 阅读全文
posted @ 2017-07-30 19:57 ISGuXing 阅读(278) 评论(0) 推荐(0) 编辑
摘要: Problem B 函数求解 Accept: 171 Submit: 540Time Limit: 1000 mSec Memory Limit : 32768 KB Accept: 171 Submit: 540Time Limit: 1000 mSec Memory Limit : 32768 阅读全文
posted @ 2017-07-30 17:05 ISGuXing 阅读(188) 评论(0) 推荐(0) 编辑
摘要: Problem A 据说题目很水 Accept: 113 Submit: 445Time Limit: 1000 mSec Memory Limit : 32768 KB Accept: 113 Submit: 445Time Limit: 1000 mSec Memory Limit : 3276 阅读全文
posted @ 2017-07-30 16:58 ISGuXing 阅读(104) 评论(0) 推荐(0) 编辑