- 博客(86)
- 收藏
- 关注
转载 Zipf's Law(map容器)
Zipf's LawTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 1767 Accepted: 532DescriptionHarvard linguistics professor George Kingsley Zipf (1902-1950) obse
2015-06-30 19:35:10 681
转载 畅通工程续(最短路径)
这一题有点坑!就是如果两个点一样你得输出0,一直WA,最后发现了,我去! #include#include#includeusing namespace std;const int infinity=0x3f3f3f3f;const int maxnum=2010;int map[maxnum][maxnum];//记录两个点的距离int vis[maxnum]
2015-06-30 18:23:07 365
转载 Kth number(划分树)
Kth numberTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6217 Accepted Submission(s): 1986Problem DescriptionGive you a sequenc
2015-06-28 17:38:17 376
转载 划分树小结
最近学习了一下划分树,下面总结一下。我们在求区间最值的时候,一般可以用线段树解决,但是如果要求区间第k小或者第k大值的话线段树就有点力不从心了,这是我们可以用划分树来解决。划分树利用了快速排序的思想,首先是建树,我们设当前区间的中位数为mid,(为了能快速找到区间的中位数,我们一般先对原序列做一次排序)则我们将区间中比mid小的放入左子树,将区间中比mid大数的放入右子树中,和mid相等的要讨
2015-06-28 17:11:33 337
转载 最短路径问题(最短路径)
最短路径问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16506 Accepted Submission(s): 4940Problem Description给你n个点,m条无向边,每条边都有长度d和花
2015-06-27 18:01:57 808
转载 最短路(最短路径)
最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 39539 Accepted Submission(s): 17235Problem Description在每年的校赛里,所有进入决赛的同学都会获得一件很
2015-06-27 15:18:57 525 1
转载 最短路径
最短路径的迪杰斯特拉算法跟最小生成树的普利姆算法很像! 但是这里的像只是代码相似,实质是不一样的! 普利姆算法是从任意点开始,找到跟他最近的点记录距离,然后 从这一点出发一次找最短的距离,直到循环结束!所以用于在n 个点找出n-1条路径将它们连接起来! 而迪杰斯特拉算法从任一点开始找到未访问的点到这个点的距 离,然后记录最小的
2015-06-27 15:06:45 248
转载 Difference Between Primes(素数打表,素数表与数表通用)
Difference Between PrimesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2735 Accepted Submission(s): 768Problem DescriptionAll y
2015-06-26 20:59:03 361
转载 String Task
B - String TaskTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 118ADescriptionPetya started to attend programming l
2015-06-26 14:02:57 354
转载 A Magic Lamp(RMQ)
A Magic LampTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2041 Accepted Submission(s): 816Problem DescriptionKiki likes traveli
2015-06-25 20:10:14 386
转载 求和(数学,等差数列)
求和Time Limit: 1000 ms Memory Limit: 64 MBTotal Submission: 64 Submission Accepted: 16Description对于正整数n,k,我们定义这样一个函数f,它满足如下规律f(n,k=1)=-1+2-3+4-5+6...nf(n,k=2)=-1-2+3+4-5-6...nf(n,k=
2015-06-24 19:58:13 1579
转载 First Blood(暴力加剪枝)
First BloodTime Limit: 1000 ms Memory Limit: 64 MBTotal Submission: 79 Submission Accepted: 23Description盖伦是个小学一年级的学生,在一次数学课的时候,老师给他们出了一个难题:老师给了一个正整数 n,需要在不大于n的范围内选择三个正整数(可以是相同的),使它们三个
2015-06-24 19:56:27 819
转载 Repository(字典树,避免重复计数)
RepositoryTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2865 Accepted Submission(s): 1096Problem DescriptionWhen you go shoppin
2015-06-24 14:38:16 554
转载 Color the ball(树状数组之插点问线问题)
Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11734 Accepted Submission(s): 5872Problem DescriptionN个气球排成一排,从左到右依
2015-06-24 13:46:53 426
转载 Color the ball
Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11732 Accepted Submission(s): 5871Problem DescriptionN个气球排成一排,从左到右依
2015-06-23 21:44:22 358
转载 Hiking Trip(bfs+优先队列)
Hiking TripTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1444 Accepted Submission(s): 628Problem DescriptionHiking in the m
2015-06-23 20:04:05 765
转载 幸福列车(多个优先队列)
幸福列车Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 1851 Accepted Submission(s): 554Problem Description一批幸福的列车即将从杭州驶向幸福的终点站——温
2015-06-23 14:18:35 468
转载 优先队列详解
优先队列是一种容器适配器(容器适配器的概念本人不会解释,故此处无法作出说明),它的第一个元素(位于头部top)总是队列中最大的元素,这里的“最大”是指队列元素的严格弱序中的“最大”。严格弱序是一系列数或事物按照一定的比较关系“ 在内存充足的情况下,优先队列能被无限地插入元素。 优先队列作为一个容器适配器,它使用其它容器作为底层容器,并提供一系列访问元素的函数。优先队列中的元素从
2015-06-23 12:50:40 1967
转载 Stones(优先队列)
StonesTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1272 Accepted Submission(s): 784Problem DescriptionBecause of the wrong
2015-06-23 12:47:55 461
转载 Equations(哈希)
EquationsTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6254 Accepted Submission(s): 2531Problem DescriptionConsider equations h
2015-06-22 19:25:01 322
转载 求高精度幂
求高精度幂Time Limit: 500MS Memory Limit: 10000KTotal Submissions: 145719 Accepted: 35546Description对数值很大、精度很高的数进行高精度计算是一类十分常见的问题。比如,对国债进行计算就是属于这类问题。 现在要你解决的问题是:对一
2015-06-22 15:19:17 289
转载 Billboard(线段树区间更新与求值)
BillboardTime Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13621 Accepted Submission(s): 5853Problem DescriptionAt the entranc
2015-06-22 13:30:36 331
转载 I Hate It
I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 47206 Accepted Submission(s): 18476Problem Description很多学校流行一种比较的习惯。老师们很
2015-06-21 21:08:51 313
转载 改革春风吹满地(矢量的差乘)
改革春风吹满地Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22657 Accepted Submission(s): 11716Problem Description“ 改革春风吹满地,不会AC没关系;
2015-06-21 15:22:55 393
转载 矢量的概念
矢量的概念: 如果一条线段的端点是有次序之分的,我们把这种线段成为有向线段(directed segment)。如果有向线段p1p2的起点p1在坐标原点,我们可以把它称为矢量(vector)p2。 矢量加减法: 设二维矢量P = ( x1, y1 ),Q = ( x2 , y2 ),则矢量加法定义为: P + Q = ( x1 + x2 , y1 + y2 ),同样的,矢量减
2015-06-21 15:13:31 735
转载 圈水池(凸包)
这一题就是让你找凸包的点,最基础的凸包问题,可是感觉还是 很难!先发一下代码! #include#include#include#includeusing namespace std;struct A{ int x; int y;}s[105],s1[105];int fun(A a1,A a2){ if(a1.y=
2015-06-21 14:37:40 274
转载 凸包问题之GrahamScan解法
首先了解一下GrahamScan解法的原理:当沿着Convex hull逆时针漫游时,总是向左转在极坐标系下按照极角大小排列,然后逆时针方向漫游点集,去除非Convex hull顶点(非左 转点)。第一步 这里P0是极坐标的中心,在编程的时候,经常就是选择y坐标最低的点第二步:这样就建立起了所有点到P0的极坐标第三步:
2015-06-21 14:35:49 823
转载 Stars(一定要看,树状数组差点问线问题)
#include#include#includeconst int N=16000;const int Mx=32100;using namespace std;int tree[Mx];int ans[16000];int lowbit(int n){ return n&(-n);}int add(int i,int data){
2015-06-20 21:24:52 267
转载 Girls and Boys(最大独立集问题)
Girls and BoysTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8386 Accepted Submission(s): 3853Problem Descriptionthe second ye
2015-06-20 16:06:01 431
转载 Machine Schedule(最小点覆盖数)
Machine ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6579 Accepted Submission(s): 3293Problem DescriptionAs we all kno
2015-06-20 15:32:50 581
转载 最小点覆盖问题详解
那么一如既往,还是个人觉得学习某一个知识点之前先粗俗的了解其是个什么东东,然后再去了解概念比较好...那么下面结合题目来了解:首先最最重要的是理解题意,有k个任务,每个任务task_i可以用机器A的x_i模式做,也可以由机器B的y_i模式做(值得注意的是只有两个机器,但是有不同的模式,每次可以在一个模式下工作),在做所有的任务之前,A与B的模式都最开始调为0,为了把所有任务做完,我们需要按照不
2015-06-20 14:36:24 8554
转载 Courses(二分图完全匹配)
CoursesTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4631 Accepted Submission(s): 2213Problem DescriptionConsider a group of
2015-06-19 20:55:47 411
转载 A × B problem
1253: A × B problemTime Limit: 1 Sec Memory Limit: 64 MBSubmit: 6 Solved: 4[Submit][Status][Web Board]DescriptionRedraiment碰到了一个难题,需要请你来帮忙:给你两个整数,请你计算A × B。Input数据的第一行是整数T(
2015-06-19 13:17:05 1074
转载 Gopher(二分图最大匹配)
Problem K: GopherTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 5 Solved: 4[Submit][Status][Web Board]DescriptionThe gopher family, having averted the canine threat, must face a n
2015-06-19 12:18:06 270
转载 Hay Points(map容器)
1426: Hay PointsTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 4 Solved: 3[Submit][Status][Web Board]DescriptionEach employee of a bureaucracy has a job description - a few paragr
2015-06-19 12:08:54 464
转载 过山车
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13438 Accepted Submission(s): 5887Problem DescriptionRPG girls今天和大家一起去游乐场玩,终于可
2015-06-18 21:53:24 963
转载 二分图匹配
今天看了很多博客!终于看懂了一点点,想记录一下!首先你要知道什么是增广路径(虽然我现在还不明白) 这是一种用增广路求二分图最大匹配的算法。它由匈牙利数学家Edmonds于1965年提出,因而得名。 定义 未盖点:设Vi是图G的一个顶点,如果Vi 不与任意一条属于匹配M的边相关联,就称Vi 是一个未盖点。交错路:设P是图G的一条路,如果P的任意两条相邻的边一定是一条属
2015-06-18 21:18:52 337
转载 统计单词数(C++stl str.find()函数)
问题 K: Gopher时间限制: 1 Sec 内存限制: 128 MB提交: 3 解决: 3[提交][状态][讨论版]题目描述The gopher family, having averted the canine threat, must face a new predator.The are n gophers and m gopher h
2015-06-18 18:25:54 2005 1
转载 A MST Problem
Problem H: A MST ProblemTime Limit: 1 Sec Memory Limit: 32 MBSubmit: 5 Solved: 4[Submit][Status][Web Board]DescriptionIt is just a mining spanning tree ( 最小生成树 ) problem, what make
2015-06-18 13:01:41 847
转载 Game of Diamond
Problem J: Game of DiamondTime Limit: 1 Sec Memory Limit: 32 MBSubmit: 8 Solved: 3[Submit][Status][Web Board]DescriptionDiamond mine is a mini-game which is played on an 8 * 8 board
2015-06-18 13:00:32 335
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人