上一页 1 2 3 4 5 6 7 8 9 10 ··· 20 下一页
摘要: Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Description You are given a sequence of positive integers x1, x2, ..., xn and two non-negative integers a and b. Your ... 阅读全文
posted @ 2017-03-16 17:07 Pic 阅读(263) 评论(0) 推荐(0) 编辑
摘要: C. Alice and Bob time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output It is so boring in the summer holiday, isn't it? So Alice and Bob have in... 阅读全文
posted @ 2017-03-15 22:21 Pic 阅读(231) 评论(0) 推荐(0) 编辑
摘要: B. Fixed Points time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A permutation of length n is an integer sequence such that each integer fr... 阅读全文
posted @ 2017-03-15 21:50 Pic 阅读(176) 评论(0) 推荐(0) 编辑
摘要: Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Description You want to arrange n integers a1, a2, ..., an in some order in a row. Let's define the value of an arrangemen... 阅读全文
posted @ 2017-03-15 21:48 Pic 阅读(125) 评论(0) 推荐(0) 编辑
摘要: 免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24440 Accepted Submission(s): 8264 Problem Description 都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽... 阅读全文
posted @ 2017-03-13 18:25 Pic 阅读(163) 评论(0) 推荐(0) 编辑
摘要: Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8767 Accepted Submission(s): 3398 Problem Description 某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个... 阅读全文
posted @ 2017-03-13 13:28 Pic 阅读(112) 评论(0) 推荐(0) 编辑
摘要: Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Description Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ou... 阅读全文
posted @ 2017-03-13 13:00 Pic 阅读(166) 评论(0) 推荐(0) 编辑
摘要: 转自http://www.cnblogs.com/drizzlecrj/archive/2008/09/12/1290176.html 稳定婚姻是组合数学里面的一个问题。 问题大概是这样:有一个社团里有n个女生和n个男生,每位女生按照她的偏爱程度将男生排序,同时每位男生也按照自己的偏爱程度将女生排序。然后将这n个女生和n个男生配成完备婚姻。 如果存在两位女生A和B,两位男生a和b,使得A和a... 阅读全文
posted @ 2017-03-12 15:58 Pic 阅读(140) 评论(0) 推荐(0) 编辑
摘要: TravelTime Limit: 10000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3059 Accepted Submission(s): 1051 Problem Description One day, Tom traveled to a... 阅读全文
posted @ 2017-03-11 15:46 Pic 阅读(139) 评论(0) 推荐(0) 编辑
摘要: 占坑---慢慢补。。。 tarjan算法通过两个时间戳标记,利用DFS,实现了求割边,割点 栈的加入使得tarjan可以记录DFS过程中遍历过的节点,由此即可求出点双联通分量(不含割点),边双联通分量(不含割边)。对于有向图,可以求出强联通分量 阅读全文
posted @ 2017-03-09 22:07 Pic 阅读(114) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 9 10 ··· 20 下一页