摘要: DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes f... 阅读全文
posted @ 2015-07-20 11:57 Gladitor 阅读(812) 评论(0) 推荐(0) 编辑
摘要: 滑雪 Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescription Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡... 阅读全文
posted @ 2015-07-17 17:31 Gladitor 阅读(214) 评论(0) 推荐(0) 编辑
摘要: 二分Time Limit:2000MSMemory Limit:32768KB64bit IO Format:%lld & %lluDescriptionYou are givenNsticks having distinct lengths; you have to form some trian... 阅读全文
posted @ 2015-07-15 21:10 Gladitor 阅读(473) 评论(0) 推荐(0) 编辑
摘要: Cable masterTime Limit:1000MSMemory Limit:10000KTotal Submissions:28644Accepted:6076DescriptionInhabitants of the Wonderland have decided to hold a re... 阅读全文
posted @ 2015-07-15 16:48 Gladitor 阅读(325) 评论(0) 推荐(0) 编辑
摘要: 贪心Time Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uDescription杂货店出售一种由N(3 2 #include 3 #include 4 #include 5 using namespace std; ... 阅读全文
posted @ 2015-07-14 21:29 Gladitor 阅读(248) 评论(0) 推荐(0) 编辑
摘要: 1 #include 2 #include 3 #include 4 using namespace std; 5 6 int a1[4001],a2[4001]; 7 int b1[4001],b2[4001]; 8 int sum1[4001*4000],sum2[4001*4000]... 阅读全文
posted @ 2015-07-14 18:18 Gladitor 阅读(154) 评论(0) 推荐(0) 编辑
摘要: Poj3984 迷宫问题 1 #include 2 #include 3 #include 4 #include 5 using namespace std; 6 int maze[5][5]; 7 int dir[4][2] = {{-1,0},{0,1},{1,0},{0,-1}}; 8... 阅读全文
posted @ 2015-07-14 17:24 Gladitor 阅读(2166) 评论(0) 推荐(0) 编辑