12 2015 档案

摘要:Accept: 2 Submit: 16Time Limit: 2000 mSec Memory Limit : 32768 KB Problem DescriptionRecently, you have found your interest in s... 阅读全文
posted @ 2015-12-28 11:09 Herumw 阅读(135) 评论(0) 推荐(0)
摘要:Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 605 Accepted Submission(s):... 阅读全文
posted @ 2015-12-27 17:53 Herumw 阅读(149) 评论(0) 推荐(0)
摘要:Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1165 Accepted Submission(... 阅读全文
posted @ 2015-12-11 18:56 Herumw 阅读(189) 评论(0) 推荐(0)
摘要:time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhen Kefa came to the restaurant... 阅读全文
posted @ 2015-12-11 15:46 Herumw 阅读(149) 评论(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 阅读(212) 评论(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 阅读(127) 评论(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 阅读(178) 评论(0) 推荐(0)
摘要:Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 36 Accepted: 2Description有一天,小Q给了小J一些数字,让小J帮忙找到其中最大的数,由于小J是一个程序猿,当然写了一个代码很快的... 阅读全文
posted @ 2015-12-07 20:16 Herumw 阅读(133) 评论(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 阅读(115) 评论(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 阅读(210) 评论(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 阅读(118) 评论(0) 推荐(0)
摘要:题目详见http://7xjob4.com1.z0.glb.clouddn.com/3f644de6844d64706eb36baa3a0c27b0这题是普通的拓扑排序,要把每一层的都保存下来。#include#include#include#include#incl... 阅读全文
posted @ 2015-12-05 17:57 Herumw 阅读(128) 评论(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 阅读(112) 评论(0) 推荐(0)
摘要:Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3712 Accepted Submission(s... 阅读全文
posted @ 2015-12-04 19:34 Herumw 阅读(122) 评论(0) 推荐(0)
摘要:Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11496 Accepted: 2815DescriptionFacer's pet cat just gave birth to a brood of... 阅读全文
posted @ 2015-12-04 15:57 Herumw 阅读(197) 评论(0) 推荐(0)
摘要:Time Limit: 3000MS Memory Limit: 131072KTotal Submissions: 18578 Accepted: 7858DescriptionGiven a n × n matrix A and a positive intege... 阅读全文
posted @ 2015-12-04 14:43 Herumw 阅读(110) 评论(0) 推荐(0)
摘要:ProblemGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or g... 阅读全文
posted @ 2015-12-04 12:45 Herumw 阅读(155) 评论(0) 推荐(0)
摘要:Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21752 Acce... 阅读全文
posted @ 2015-12-04 09:49 Herumw 阅读(151) 评论(0) 推荐(0)
摘要:Accept: 204 Submit: 627Time Limit: 1000 mSec Memory Limit : 65536 KB Problem Descriptionn个六边形排成一行,相邻两个六边形共用一条边,如下图所示:记这个图形的生成树个数... 阅读全文
posted @ 2015-12-03 20:03 Herumw 阅读(123) 评论(0) 推荐(0)
摘要:递推求值时间限制:1000 ms | 内存限制:65535 KB难度:4描述给你一个递推公式:f(x)=a*f(x-2)+b*f(x-1)+c并给你f(1),f(2)的值,请求出f(n)的值,由于f(n)的值可能过大,求出f(n)对1000007取模后的值。注意:... 阅读全文
posted @ 2015-12-02 15:40 Herumw 阅读(137) 评论(0) 推荐(0)
摘要:FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11510 Accepted: 8179DescriptionIn the Fibonacci integer sequence, F... 阅读全文
posted @ 2015-12-01 21:33 Herumw 阅读(101) 评论(0) 推荐(0)