Loading

摘要: PartyTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0Accepted Submission(s): 0Problem Description... 阅读全文
posted @ 2014-05-24 14:22 北岛知寒 阅读(276) 评论(0) 推荐(0) 编辑
摘要: InformationTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0Accepted Submission(s): 0Problem Descr... 阅读全文
posted @ 2014-05-24 14:21 北岛知寒 阅读(177) 评论(0) 推荐(0) 编辑
摘要: B. Kuriyama Mirai's StonesKuriyama Mirai has killed many monsters and got many (namely n) stones. She numbers the stones from 1 to n. The cost of the ... 阅读全文
posted @ 2014-05-24 14:18 北岛知寒 阅读(416) 评论(0) 推荐(0) 编辑
摘要: A. Kitahara Haruki's GiftKitahara Haruki has bought n apples for Touma Kazusa and Ogiso Setsuna. Now he wants to divide all the apples between the fri... 阅读全文
posted @ 2014-05-24 14:17 北岛知寒 阅读(359) 评论(0) 推荐(0) 编辑
摘要: Agri-NetTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 37109Accepted: 14982DescriptionFarmer John has been elected mayor of his town! One of... 阅读全文
posted @ 2014-05-24 10:23 北岛知寒 阅读(665) 评论(0) 推荐(0) 编辑
摘要: 很早就想写一下最短路的总结了,但是一直懒,就没有写,这几天又在看最短路,虽没什么长进,但还是加深了点理解。 于是就想写一个大点的总结,要写一个全的。 在本文中因为邻接表在比赛中不如前向星好写,而且前向星效率很可观。所以,本文的代码存图方式只有两种:前向星 or 邻接矩阵。 本文包含如下内容: 1、B 阅读全文
posted @ 2014-05-24 10:15 北岛知寒 阅读(755) 评论(2) 推荐(1) 编辑