- 博客(15)
- 资源 (1)
- 收藏
- 关注
原创 codeforces 548 C Mike and Frog
time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike has a frog and a flower. His frog is named Xaniar and his fl
2015-05-27 09:32:58 1020
原创 codeforces 544 D. Destroying Roads
time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn some country there are exactly n cities and m bidirectional
2015-05-25 21:23:37 978
原创 codeforces 546 D
time limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwo soldiers are playing a game. At the beginning first of them
2015-05-23 10:58:25 856
原创 codeforces 466 C Number of Ways
time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou've got array a[1], a[2], ..., a[n], consisting of n integers
2015-05-19 21:54:49 616
原创 Codeforces 467 C. George and Job
time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe new ITone 6 has been released recently and George got really
2015-05-19 20:23:53 1032
原创 hdu1828 Picture
Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3215 Accepted Submission(s): 1679Problem DescriptionA number of rectangular pos
2015-05-17 20:54:30 763
转载 线段树辅助——扫描线法计算矩形周长并(轮廓线)
例题:hdu 1828 Picture有两种方法,不过常用的第二种,两种都说一下。第一种:把矩形分成横线和竖线去处理,可知是完全相同的操作,我们来讲下怎么算出横线部分,竖线部分就是照搬即可。将横线保存在一个表中,按横线所处的竖直位置排序(升序),另外每条横线带一个标记值,原矩形的下线为1,上线为-1(对应过去就是插入线段和删除线段)从低到高扫描横线,没扫
2015-05-17 20:52:53 1444
原创 hdu1255覆盖的面积
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4135 Accepted Submission(s): 2041Problem Description给定平面上若干矩形,求出被这些矩形覆盖过至少两次
2015-05-17 19:21:40 801
转载 扫描线矩形面积交
线段树求面积并升级版题意中文,不解释这题的代码在一般的线段树求面积并的基础上进行了修改,但是所用的思想是一样的,所以不难理解回忆一下一般的求矩形覆盖面积,线段树节点里面有一个重要的变量,cnt。这个变量表示了该节点表示的区间被完全覆盖,如果cnt=0,说明没有被完全覆盖(但不代表没有被覆盖),要算出该节点所代表的区间被覆盖的长度,需要由它左右孩子节点被覆盖的长度相加所得。如
2015-05-17 19:21:15 617
转载 线段树辅助——扫描线法计算矩形面积并
分析:1.矩形比较多,坐标也很大,所以横坐标需要离散化(纵坐标不需要),熟悉离散化后这个步骤不难,所以这里不详细讲解了,不明白的还请百度2.重点:扫描线法:假想有一条扫描线,从左往右(从右往左),或者从下往上(从上往下)扫描过整个多边形(或者说畸形。。多个矩形叠加后的那个图形)。如果是竖直方向上扫描,则是离散化横坐标,如果是水平方向上扫描,则是离散化纵坐标。下面的分析都是离散化横坐
2015-05-17 19:19:57 571
原创 poj1151 Atlantis
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18723 Accepted: 7105DescriptionThere are several ancient Greek texts that contain descriptions of the fabled islan
2015-05-17 17:39:51 804
原创 Codeforces 486 C Palindrome Transformation
time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputNam is playing with a string on his computer. The string consists
2015-05-15 21:56:47 773
原创 Codeforces Round 469 C 24 Game
time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle X used to play a card game called "24 Game", but recently
2015-05-14 22:07:34 850
原创 Codeforces Round 445 C. DZY Loves Physics
time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDZY loves Physics, and he enjoys calculating density.Almost everything ha
2015-05-08 23:01:20 792
转载 框架导航的写法
首先是 targettarget 属性 -- 链接目标不符合标准网页设计的理念,不赞成使用.取值_blank -- 在新窗口中打开链接_parent -- 在父窗体中打开链接_self -- 在当前窗体打开链接,此为默认值_top -- 在当前窗体打开链接,并替换当前的整个窗体(框架页)一个对应的框架页的名称 -- 在对应框架页中打开导航框架的写法,示例为两列的
2015-05-02 21:29:19 1002
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人