摘要: Stockbroker Grapevine Time Limit: 1000MS Memory Limit: 10000K Description Stockbrokers are known to overreact to rumours. You have been contracted to 阅读全文
posted @ 2018-10-08 23:15 洛沐辰 阅读(141) 评论(0) 推荐(0) 编辑
摘要: Cow Hurdles Time Limit: 1000MS Memory Limit: 65536K Description Farmer John wants the cows to prepare for the county jumping competition, so Bessie an 阅读全文
posted @ 2018-10-08 23:06 洛沐辰 阅读(118) 评论(0) 推荐(0) 编辑
摘要: 题意:给你点、边,求起点到终点的最短距离。 题解:由于题目的数据量特别大,所以需要用邻接表来存边,之后对Dijkstra算法稍微魔改一下就可以了,本来以为会超时,做好了打堆优化的准备,结果卡时间过了,可以说很开心了. 注意SPFA会超时。 include include include includ 阅读全文
posted @ 2018-10-08 23:00 洛沐辰 阅读(137) 评论(0) 推荐(0) 编辑
摘要: Candies Time Limit: 1500MS Memory Limit: 131072K Description During the kindergarten days, flymouse was the monitor of his class. Occasionally the hea 阅读全文
posted @ 2018-10-08 15:32 洛沐辰 阅读(119) 评论(0) 推荐(0) 编辑
摘要: 题意:t组数据,每组数据有abcd四个数,其中d可以加到abc任意一个数上(d可以拆分),求公式a^2 + b^2 + c^2 + 7 min(a,b,c)的最大值。 题解:首先明确一点,平方的增长速度是比较快的,所以当d比较大时,直接把他累加到一个数上就可以了,对于小范围数据枚举就可以。结果当时有 阅读全文
posted @ 2018-10-08 14:55 洛沐辰 阅读(186) 评论(0) 推荐(0) 编辑