- 博客(40)
- 资源 (8)
- 收藏
- 关注
RSS订阅原创 POJ 2195-Going Home（KM算法/最小费用最大流算法）
Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21730 Accepted: 10990DescriptionOn a grid map there are n little men and n houses. In each u
2016-08-30 21:06:02
919
原创 HDU 2255-奔小康赚大钱（Kuhn-Munkras算法/KM算法-完备匹配下的最大权匹配）
奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7423 Accepted Submission(s): 3301Problem Description传说在遥远的地方有一个非常富裕的村落,
2016-08-30 21:03:36
685
原创 Baby-Step-Gaint-Step算法详解
Baby-Step-Gaint-Step Baby-Step-Gaint-Step用来求解高次同余方程 A^x ≡ B (mod C) 中已知A B C求较大x的情况。 按wiki百科所言：①令x=i*n+j，其中m=ceil(sqrt(C))，原式变为A^(i*n+j) = B (mod C)，两边同时乘上A^(-n*i)，可以得到A^j=B*A^(-n*i) (
2016-08-29 15:26:06
946
原创 POJ 1129-Channel Allocation（顶点着色）
Channel AllocationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14559 Accepted: 7406DescriptionWhen a radio station is broadcasting over a very larg
2016-08-27 12:01:59
596
原创 计算两个一维数组的卷积
a[m]和b[n]分别为两个一维数组，c[m+n-1]是卷积数组。#include #include #include #include #include #include #include #include using namespace std;#define INF 0xfffffff#define maxn 100010int main(){ int
2016-08-26 09:47:05
12853
1
原创 ZOJ 2588-Burning Bridges（割边）
Burning BridgesTime Limit: 5 Seconds Memory Limit: 32768 KBFerry Kingdom is a nice little country located on N islands that are connected by M bridges. All bridges are very beauti
2016-08-21 09:16:00
511
原创 重连通分量的求解
重连通分量的求解输入顶点数和边数，边的两个顶点；输出各连通分量的每条边，每个连通分量占一行。#include #include #include #include #include #include #include #include using namespace std;#define INF 0xfffffff#define maxn 1010#defi
2016-08-21 08:40:58
825
原创 HDU 5867-Water problem（单词字母个数）
Water problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 254 Accepted Submission(s): 168Problem DescriptionIf the numbers
2016-08-20 19:01:22
429
原创 POJ 1523-SPF（Tarjan算法-关节点）
SPFTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8018 Accepted: 3675DescriptionConsider the two networks shown below. Assuming that data moves around
2016-08-20 13:19:59
568
原创 POJ 1469-COURSES（二分图匹配入门-匈牙利算法）
COURSESTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21307 Accepted: 8374DescriptionConsider a group of N students and P courses. Each student visits
2016-08-17 20:03:27
552
原创 POJ 1325-Machine Schedule（二分图匹配-匈牙利算法）
Machine ScheduleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14308 Accepted: 6107DescriptionAs we all know, machine scheduling is a very classical pr
2016-08-17 19:02:29
1054
原创 使用腾讯云建一个基于自己域名的网站
使用腾讯云建一个基于自己域名的网站一、申请购买腾讯云服务 （1）实名认证 学生用户申请学生身份认证（这样就可以享受1元扶持计划，每月发放代金券，券后每月云服务器1元）（2）使用代金券购买云主机、云数据库和域名（比如我买的是下面这种主机，OS是CentOS，所以下面都以这种操作系统为例）（3）查看自己的设备，记住IP地址的公网
2016-08-17 09:30:07
9601
原创 POJ 3469-Dual Core CPU（Dinic 最大流/最小割算法）
Dual Core CPUTime Limit: 15000MS Memory Limit: 131072KTotal Submissions: 22932 Accepted: 9983Case Time Limit: 5000MSDescriptionAs more and more computers ar
2016-08-15 19:35:30
1222
原创 POJ 1149-PIGS（Ford-Fulkerson 标号法求网络最大流）
PIGSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20029 Accepted: 9178DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mi
2016-08-15 16:17:08
1100
原创 Fleury算法-输出欧拉回路
佛洛莱算法输出欧拉回路。#include #include #include #include #include #include #include #define maxn 10010#define INF 0xfffffffusing namespace std;struct Stack{ int top,node[maxn];}s;int edg
2016-08-14 17:04:55
1296
1
原创 POJ 1386-Play on Words（有向欧拉通路）
Play on WordsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11744 Accepted: 4016DescriptionSome of the secret doors contain a very interesting word puz
2016-08-14 11:08:47
460
原创 Ford-Fulkerson 标号法求网络最大流
使用Ford-Fulkerson 标号法求网络最大流。#include #include #include #include #include #include #include #define maxn 10010#define INF 0xfffffffusing namespace std;struct ArcType{ int c,f;//容量、流
2016-08-13 21:32:44
6532
原创 POJ 3169-Layout（差分约束系统-入门裸题）
LayoutTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10125 Accepted: 4874DescriptionLike everyone else, cows like to stand close to their friends when
2016-08-13 11:16:36
832
原创 POJ 1274-The Perfect Stall（二分图匹配/最大流问题）
The Perfect StallTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23108 Accepted: 10297DescriptionFarmer John completed his new barn just last week, comp
2016-08-12 17:21:08
556
原创 POJ 1364-King（差分约束系统）
KingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12246 Accepted: 4452DescriptionOnce, in one kingdom, there was a queen and that queen was expecting
2016-08-12 14:53:25
643
原创 POJ 3259-Wormholes（Bellman Ford或SPFA判负权值回路）
WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 44248 Accepted: 16280DescriptionWhile exploring his many farms, Farmer John has discovered a nu
2016-08-12 14:15:44
371
原创 HDU 1402及51 nod1028 大数乘法 V2（FFT 快速傅里叶变换）
1028 大数乘法 V2基准时间限制：2 秒 空间限制：131072 KB 分值: 80 难度：5级算法题 收藏 关注给出2个大整数A,B，计算A*B的结果。Input第1行：大数A第2行：大数B(A,B的长度 = 0）Output输出A * BInput示例123456234
2016-08-11 18:25:14
1159
原创 POJ 2778-DNA Sequence（AC自动机+构建邻接矩阵+矩阵快速幂）
DNA SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15118 Accepted: 5826DescriptionIt's well known that DNA Sequence is a sequence only contains
2016-08-10 19:04:18
475
原创 UVA 11235-Frequent values（RMQ）
Frequent values题目意思：给出一个非降序排列的整数数组A，对于一系列询问（L,R），求出AL~AR区间内出现次数最多的值出现的次数。解题思路：数组非降序，所以对整个数组进行游程编码。所求的最大值是以下三个部分的最大值：①从L到L所在的段的结束处的元素个数：right[L]-L+1②从R到R所在的段的开始处的元素个数：R-left[R]+1③
2016-08-08 17:17:19
555
原创 POJ 3928-Ping pong（树状数组+加/乘法原理）
Ping pongTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2982 Accepted: 1103DescriptionN(3<=N<=20000) ping pong players live along a west-east street(
2016-08-08 12:14:10
771
原创 HDU 5726-GCD（暴力+map）
GCDTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2527 Accepted Submission(s): 892Problem DescriptionGive you a sequence of
2016-08-08 08:50:08
551
5
原创 HDU 5769-Substring(后缀数组-不相同的子串的个数)
SubstringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 973 Accepted Submission(s): 393Problem Description?? is practicing h
2016-08-07 11:03:28
689
原创 POJ 3581-Sequence(后缀数组)
SequenceTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6485 Accepted: 1429Case Time Limit: 2000MSDescriptionGiven a sequence, {A1, A2, ..., An} w
2016-08-06 20:22:10
784
1
原创 HDU 1695-GCD（容斥原理+欧拉函数）
GCDTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9601 Accepted Submission(s): 3582Problem DescriptionGiven 5 integers: a, b
2016-08-05 15:41:23
678
原创 POJ 3370-Halloween treats（鸽巢原理）
Halloween treatsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7985 Accepted: 2905 Special JudgeDescriptionEvery year there is the same problem at
2016-08-05 11:37:33
649
原创 HDU 1028-Ignatius and the Princess III（拆分整数-母函数-无限次）
Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18862 Accepted Submission(s): 13247Problem Descripti
2016-08-04 20:23:05
480
原创 HDU 2082-找单词（母函数-有限次）
找单词Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6176 Accepted Submission(s): 4338Problem Description假设有x1个字母A， x2个字母B,....
2016-08-04 18:13:10
636
原创 POJ 1320-Street Numbers（解佩尔方程）
Street NumbersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2908 Accepted: 1621DescriptionA computer programmer lives in a street with houses numbered
2016-08-04 09:15:24
727
原创 POJ 1305-Fermat vs. Pythagoras（本原的毕达哥拉斯三元组+枚举）
Fermat vs. PythagorasTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 1555 Accepted: 908DescriptionComputer generated and assisted proofs and verificatio
2016-08-04 08:33:45
810
原创 POJ 3233-Matrix Power Series( S = A + A^2 + A^3 + … + A^k 矩阵快速幂取模)
Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 20309 Accepted: 8524DescriptionGiven a n × n matrix A and a positive integer k, fi
2016-08-03 13:42:13
1472
原创 【POJ 3243-Clever Y】 与【POJ 2417-Discrete Logging】（解高次同余方程 Baby-Step-Gaint-Step）
Clever YTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 7969 Accepted: 1986DescriptionLittle Y finds there is a very interesting formula in mathematics:
2016-08-03 11:06:37
633
原创 POJ 2891-trange Way to Express Integers（解线性同余方程组）
Strange Way to Express IntegersTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 13819 Accepted: 4451DescriptionElina is reading a book written by Ruji
2016-08-03 09:49:27
603
原创 POJ 2240-Arbitrage（套汇-Bellman Ford）
ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20523 Accepted: 8740DescriptionArbitrage is the use of discrepancies in currency exchange rates
2016-08-02 10:02:30
694
原创 Bellman Ford+SPFA队列优化（路径还原 输出最短路的路径）
①邻接表（效率较高）#include #include #include #include #include #include #include #include using namespace std;#define INF 0xfffffff#define MAXN 1010struct Edge{ int u,v,w;};Edge edge[MAXN
2016-08-02 09:05:16
1284
原创 斐波那契数列的第N项（1≤n≤10^18 矩阵快速幂）
1242 斐波那契数列的第N项基准时间限制：1 秒 空间限制：131072 KB 分值: 0 难度：基础题斐波那契数列的定义如下：F(0) = 0F(1) = 1F(n) = F(n - 1) + F(n - 2) (n >= 2)(1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 3
2016-08-01 18:08:04
2478
CHN_adm.zip
2018-04-24
江苏省各市地图svg文件
2018-04-24
Windows安装dlib的轮子dlib-18.17.100-cp27-none-win32.whl
2018-03-30
23年考研英语真题及答案(1986-2008).doc
2017-04-07
mysql-connector-java-5.1.34-bin.jar驱动
2016-09-10
POJ 1002 487-3279 测试数据 完整
2016-08-13
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人