acmtime - 博客园

Popular Cows 强连通(kosaraju)

摘要： Popular Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 30652 Accepted: 12439 Description Every cow's dream is to become the most popu 阅读全文

posted @ 2016-08-20 10:09 acmtime 阅读(190) 评论(0) 推荐(0) 编辑

迷宫城堡强连通分量(scc-tarjan)

摘要：迷宫城堡 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12923 Accepted Submission(s): 5777 Problem D 阅读全文

posted @ 2016-08-19 20:27 acmtime 阅读(323) 评论(0) 推荐(0) 编辑

阶乘问题 n！后最右边非0的数

摘要：阶乘问题题目描述也许你早就知道阶乘的含义，N阶乘是由1到N相乘而产生，如： 12! = 1 x 2 x 3 x 4 x 5 x 6 x 7 x 8 x 9 x 10 x 11 x 12 = 479,001,600 12的阶乘最右边的非零位为6。写一个程序，计算N(1<=N<=50,000,00 阅读全文

posted @ 2016-08-11 22:01 acmtime 阅读(1032) 评论(0) 推荐(0) 编辑

Counting Haybales 区间更新多颗线段树

摘要： Counting Haybales Time Limit: 10 Sec Memory Limit: 128 MB Submit: 77 Solved: 31 [Submit][Status][Discuss] Description Farmer John is trying to hire co 阅读全文

posted @ 2016-08-10 19:33 acmtime 阅读(221) 评论(0) 推荐(0) 编辑

A Simple Problem with Integers 区间更新

摘要： A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 95298 Accepted: 29682 Case Time Limit: 2000MS Description Y 阅读全文

posted @ 2016-08-10 15:54 acmtime 阅读(125) 评论(0) 推荐(0) 编辑

敌兵布阵

摘要：敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 76810 Accepted Submission(s): 32363 Problem 阅读全文

posted @ 2016-08-08 21:58 acmtime 阅读(215) 评论(0) 推荐(0) 编辑

I Hate It

摘要： I Hate It Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 65143 Accepted Submission(s): 25299 Pro 阅读全文

posted @ 2016-08-08 16:49 acmtime 阅读(117) 评论(0) 推荐(0) 编辑

满减优惠[Offer收割]编程练习赛4

摘要：题目1 : 满减优惠时间限制:10000ms单点时限:1000ms内存限制:256MB描述最近天气炎热，小Ho天天宅在家里叫外卖。他常吃的一家餐馆一共有N道菜品，价格分别是A1, A2, ... AN元。并且如果消费总计满X元，还能享受优惠。小Ho是一个不薅羊毛不舒服斯基的人，他希望选择若干道不同的阅读全文

posted @ 2016-08-07 17:14 acmtime 阅读(528) 评论(0) 推荐(0) 编辑

积水的城市 hiho[Offer收割]编程练习赛4

摘要：题目2 : 积水的城市时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述如下图所示，某市市区由M条南北向的大街和N条东西向的道路组成。其中由北向南第i条路和第i+1条路之间的距离是Bi (1 <= i < N)，由西向东第i条街和第i+1条街之间的距离是Ai (1 <= 阅读全文

posted @ 2016-08-07 16:53 acmtime 阅读(361) 评论(0) 推荐(0) 编辑

Subsequence 尺取法

摘要： Subsequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12304 Accepted: 5165 Description A sequence of N positive integers (10 < N < 10 阅读全文

posted @ 2016-08-07 11:42 acmtime 阅读(139) 评论(0) 推荐(0) 编辑