- 博客(33)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 Codeforces Round #249 (Div. 2)C. Cardiogram
time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn this problem, your task is to use ASCII graphics to paint a cardiogram.
2015-04-29 22:41:39
952
转载 KMP和扩展KMP
KMP：给出两个字符串A（称为模板串）和B（称为子串），长度分别为lenA和lenB，要求在线性时间内，对于每个A[i]（0【算法】设next[i]为满足B[i-z+1..i]==B[0..z-1]的最大的z值（也就是B的自身匹配）。设目前next[0..lenB-1]与ex[0..i-1]均已求出，要用它们来求ex[i]的值。根据ex的定义，有A[i-1-ex[i-1]+1..i-1
2015-04-28 20:03:32
412
转载 Apache2.2 安装后：the requested operation has failed 问题定位
今天按照网上的指点安装Apache2.2，安装的过程很顺利，结果发现安装完成之后右下角的Apache图标是红色的，也就是没有启动，好，那我点击图标，选择“start”，结果就出现了一个对话框提示“the requested operation has failed”。不能启动。非常郁闷，因为我完全是新手，只得上网查（网络真不错）。 看了很多文章，总结起来大概有两个方面导致上面的错误：
2015-04-28 17:16:43
512
转载 如何从Apache官网下载windows版apache服务器
由于个人有强迫倾向，下载软件都喜欢从官网下载，摸索了好久终于摸清楚怎么从Apache官网下载windows安装版的Apache服务器了，现在分享给大家。工具/原料apache方法/步骤1进入apache服务器官网http://httpd.apache.org/，这里我们以下载稳定版的httpd 2.2.29
2015-04-28 15:19:59
775
转载 MySQL数据库安装与配置详解
目录一、概述二、MySQL安装三、安装成功验证四、NavicatforMySQL下载及使用 一、概述 MySQL版本：5.6.21 下载地址：http://rj.baidu.com/soft/detail/12585.html?ald 客户端工具：NavicatforMySQL 绿色版下载地址：http://www.cr173.com/soft/
2015-04-28 14:59:28
587
原创 poj2155Matrix
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 20161 Accepted: 7532DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in th
2015-04-27 21:06:27
802
原创 hdu4819Mosaic
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 925 Accepted Submission(s): 408Problem DescriptionThe God of sheep decides to
2015-04-27 18:20:41
745
原创 poj2155Matrix
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 20160 Accepted: 7531DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in th
2015-04-27 15:55:42
624
原创 hdu4734F(x)
F(x)Time Limit: 1000/500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2188 Accepted Submission(s): 827Problem DescriptionFor a decimal number x with
2015-04-24 22:27:22
772
原创 CF 55D Beautiful numbers
D. Beautiful numberstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVolodya is an odd boy and his taste is strange a
2015-04-24 21:22:38
787
原创 hdu4352XHXJ's LIS
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1126 Accepted Submission(s): 446Problem Description#define xhxj (Xin Hang senior si
2015-04-24 20:23:44
905
原创 poj3252Round Numbers非递归数位dp解
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9894 Accepted: 3569DescriptionThe cows, as you know, have no fingers or thumbs and thus are unable to play Scissor
2015-04-22 22:50:15
830
原创 uestc250windy数
windy数 Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others)windy定义了一种windy数。不含前导零且相邻两个数字之差至少为2的正整数被称为windy数。windy想知道，在A和B之间，包括A和B，总共有多少个windy数？
2015-04-21 21:40:06
761
原创 poj1679The Unique MST判断最小生成树是否唯一以及求次小生成树边权和的讲解
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22346 Accepted: 7924DescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique.Def
2015-04-19 22:10:01
843
原创 poj1696Space Ant
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3316 Accepted: 2118DescriptionThe most exciting space discovery occurred at the end of the 20th century. In 1999, scie
2015-04-18 21:37:00
828
原创 google code jam Round 1A 2015 Problem C. Logging
ProblemA certain forest consists of N trees, each of which is inhabited by a squirrel.The boundary of the forest is the convex polygon of smallest area which contains every tree, as if a giant r
2015-04-18 18:56:01
1297
原创 hdu3530Subsequence
ime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4827 Accepted Submission(s): 1587Problem DescriptionThere is a sequence of integers.
2015-04-18 15:09:59
738
原创 poj1330Nearest Common Ancestors以及讲解倍增法求lca
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20487 Accepted: 10784DescriptionA rooted tree is a well-known data structure in computer science and engineering. An e
2015-04-16 20:03:13
1090
原创 hdu3555Bomb以及对数位dp的讲解
BombTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 9295 Accepted Submission(s): 3282Problem DescriptionThe counter-terrorists f
2015-04-15 20:52:18
1054
原创 hdu4028The time of a day
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1157 Accepted Submission(s): 500Problem DescriptionThere are no days and nights on
2015-04-14 20:40:38
692
原创 hdu1028Ignatius and the Princess III
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14724 Accepted Submission(s): 10371Problem Description"Well, it seems the first pro
2015-04-14 19:46:21
649
原创 poj1141Brackets Sequence
Brackets SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26752 Accepted: 7553 Special JudgeDescriptionLet us define a regular brackets sequenc
2015-04-13 22:10:28
675
原创 hdu1081To The Max
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8992 Accepted Submission(s): 4359Problem DescriptionGiven a two-dimensional array o
2015-04-13 19:37:26
804
原创 hdu3507Print Article
Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 6455 Accepted Submission(s): 1990Problem DescriptionZero has an old printer that d
2015-04-09 22:17:48
792
转载 斜率优化DP以及本人对原作的补充遐想
我们知道，有些DP方程可以转化成DP[i]=f[j]+x[i]的形式，其中f[j]中保存了只与j相关的量。这样的DP方程我们可以用单调队列进行优化，从而使得O(n^2)的复杂度降到O(n)。 可是并不是所有的方程都可以转化成上面的形式，举个例子：dp[i]=dp[j]+(x[i]-x[j])*(x[i]-x[j])。如果把右边的乘法化开的话，会得到x[i]*x[j]的项。这就没办法使得f[
2015-04-09 22:12:39
533
转载 牛顿迭代法快速寻找平方根
下面这种方法可以很有效地求出根号a的近似值：首先随便猜一个近似值x，然后不断令x等于x和a/x的平均数，迭代个六七次后x的值就已经相当精确了。 例如，我想求根号2等于多少。假如我猜测的结果为4，虽然错的离谱，但你可以看到使用牛顿迭代法后这个值很快就趋近于根号2了：( 4 + 2/ 4 ) / 2 = 2.25( 2.25 + 2/ 2.2
2015-04-08 21:01:44
673
原创 csu1563: Lexicography以及找出多重集的第k个串的讲解
Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 162 Solved: 52[Submit][Status][Web Board]DescriptionAn anagram of a string is any string that can be formed using the same letters as the
2015-04-07 14:19:29
871
原创 hiho一下 第四十周 题目1 : 三分·三分求极值
时间限制:10000ms单点时限:1000ms内存限制:256MB描述这一次我们就简单一点了，题目在此：在直角坐标系中有一条抛物线y=ax^2+bx+c和一个点P(x,y)，求点P到抛物线的最短距离d。提示：三分法×提示：三分法在之前的几周中我们了解到二分法作为分治中最常见的方法，适用于单调函数，逼近求解某点的值。
2015-04-05 20:03:55
994
原创 hdu4901Zombie’s Treasure Chest
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5006 Accepted Submission(s): 1032Problem Description Some brave warriors come to a
2015-04-05 19:28:41
874
原创 memset是如何赋值的以及一些遐想
根据测试得知。。。memset是获取第二个参数的二进制从右边起的八位也就是一个字节，不断重复的填充第三个参数那么多次填充到以第一个参数为起端的连续区域里至少C/C++是这样
2015-04-03 22:04:46
946
原创 poj1419Graph Coloring
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4379 Accepted: 1985 Special JudgeDescriptionYou are to write a program that tries to find an optimal coloring for
2015-04-03 21:25:30
757
原创 poj1129Channel Allocation
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12844 Accepted: 6579DescriptionWhen a radio station is broadcasting over a very large area, repeaters are used to retr
2015-04-01 22:30:36
742
原创 poj2516Minimum Cost
Minimum CostTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 14275 Accepted: 4895DescriptionDearboy, a goods victualer, now comes to a big problem, and he
2015-04-01 20:25:42
667
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人