Herumw - 博客园

摘要： time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhen Kefa came to the restaurant... 阅读全文

posted @ 2015-12-11 15:46 Herumw 阅读(126) 评论(0) 推荐(0) 编辑

摘要： Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2677 Accepted Submission(... 阅读全文

posted @ 2015-12-11 13:59 Herumw 阅读(203) 评论(0) 推荐(0) 编辑

摘要： Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2046 Accepted Submission(s)... 阅读全文

posted @ 2015-12-10 13:32 Herumw 阅读(112) 评论(0) 推荐(0) 编辑

摘要： Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 144 Accepted Submission(s):... 阅读全文

posted @ 2015-12-09 20:21 Herumw 阅读(162) 评论(0) 推荐(0) 编辑

摘要： Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 36 Accepted: 2Description有一天，小Q给了小J一些数字，让小J帮忙找到其中最大的数，由于小J是一个程序猿，当然写了一个代码很快的... 阅读全文

posted @ 2015-12-07 20:16 Herumw 阅读(128) 评论(0) 推荐(0) 编辑

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2181 Accepted Submission(s)... 阅读全文

posted @ 2015-12-07 11:27 Herumw 阅读(108) 评论(0) 推荐(0) 编辑

摘要：详细题目见：http://7xjob4.com1.z0.glb.clouddn.com/0f10204481da21e62f8c145939e5828e思路：记dp[i][j]表示第i个木板尾部在j的方案数。那么对于i+1,可以分三种情况讨论，一种是i+1的头部在第i... 阅读全文

posted @ 2015-12-05 21:48 Herumw 阅读(206) 评论(0) 推荐(0) 编辑

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2383 Accepted Submission(s)... 阅读全文

posted @ 2015-12-05 20:54 Herumw 阅读(109) 评论(0) 推荐(0) 编辑

摘要：题目详见http://7xjob4.com1.z0.glb.clouddn.com/3f644de6844d64706eb36baa3a0c27b0这题是普通的拓扑排序，要把每一层的都保存下来。#include#include#include#include#incl... 阅读全文

posted @ 2015-12-05 17:57 Herumw 阅读(115) 评论(0) 推荐(0) 编辑

摘要： Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3354 Accepted Submission(s)... 阅读全文

posted @ 2015-12-05 10:55 Herumw 阅读(103) 评论(0) 推荐(0) 编辑

Herumw's Blog