摘要: Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1495Description大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因... 阅读全文
posted @ 2014-08-24 11:00 Damonll 阅读(264) 评论(0) 推荐(0) 编辑
摘要: Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3984Description 定义一个二维数组: int maze[5][5] = { 0, 1, 0, ... 阅读全文
posted @ 2014-08-22 20:58 Damonll 阅读(397) 评论(0) 推荐(0) 编辑
摘要: Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 3607DescriptionKochiya Sanae is a lazy girl who makes an... 阅读全文
posted @ 2014-08-20 21:58 Damonll 阅读(267) 评论(0) 推荐(0) 编辑
摘要: Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription The least common multiple (LCM) of a set of positive int... 阅读全文
posted @ 2014-08-20 10:46 Damonll 阅读(152) 评论(0) 推荐(0) 编辑
摘要: Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionMarsha and Bill own a collection of marbles. They want to... 阅读全文
posted @ 2014-08-19 16:50 Damonll 阅读(185) 评论(0) 推荐(0) 编辑
摘要: Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription 在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店... 阅读全文
posted @ 2014-08-13 23:25 Damonll 阅读(144) 评论(0) 推荐(0) 编辑
摘要: Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionBackgroundThe knight is getting bored of seeing the same ... 阅读全文
posted @ 2014-08-13 22:45 Damonll 阅读(154) 评论(0) 推荐(0) 编辑
摘要: Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2122Descriptionice_cream’s world becomes stronger and ... 阅读全文
posted @ 2014-08-13 00:05 Damonll 阅读(171) 评论(0) 推荐(0) 编辑
摘要: Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1272Description 上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设... 阅读全文
posted @ 2014-08-10 14:15 Damonll 阅读(165) 评论(0) 推荐(0) 编辑
摘要: 1 #include 2 #include 3 using namespace std; 4 int ans; 5 int max1=0; 6 int a[200010]; 7 struct Node{ 8 int left; 9 int right;10 int max;... 阅读全文
posted @ 2014-08-09 21:37 Damonll 阅读(143) 评论(0) 推荐(0) 编辑