2015年07月_MiniSheep_CS

原创 POJ3579(Hello Kiki 中国剩余定律,同余方程)

Hello KikiTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2548 Accepted Submission(s): 933Problem DescriptionOne day I was shoppi

2015-07-31 20:55:51 668

原创 POJ1573(X问题中国剩余定律)

X问题Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4234 Accepted Submission(s): 1351Problem Description求在小于等于N的正整数中有多少个X满足：X

2015-07-31 19:39:57 362

原创 POJ2891 Strange Way to Express Integers(解多元线性同余方程)

Strange Way to Express IntegersTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 11289 Accepted: 3482DescriptionElina is reading a book written by Ruji

2015-07-31 12:54:42 931

原创 hdu多校第三场 Solve this interesting problem (5323 线段树模拟 + DFS)

Solve this interesting problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1810 Accepted Submission(s): 542Problem Description

2015-07-29 22:08:23 609

原创 POJ2992 Divisors(整数分解)

DivisorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10847 Accepted: 3214DescriptionYour task in this problem is to determine the number of divisors

2015-07-29 20:26:13 735

原创 POJ2142 The Balance(扩展欧几里德)

The BalanceTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 5016 Accepted: 2197DescriptionMs. Iyo Kiffa-Australis has a balance and only two kinds of wei

2015-07-28 10:10:44 3608

原创 POJ2115 C Looooops(扩展欧几里得)

C LooooopsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19837 Accepted: 5301DescriptionA Compiler Mystery: We are given a C-language style for loop of

2015-07-27 21:49:59 347

转载前向星

我们首先来看一下什么是前向星.前向星是一种特殊的边集数组,我们把边集数组中的每一条边按照起点从小到大排序,如果起点相同就按照终点从小到大排序,并记录下以某个点为起点的所有边在数组中的起始位置和存储长度,那么前向星就构造好了.用len[i]来记录所有以i为起点的边在数组中的存储长度.用head[i]记录以i为边集在数组中的第一个存储位置.

2015-07-27 11:06:07 1742

原创 ACdream DP专题训练

A - 小彭玉的扫荡食堂计划Time Limit: 20000/10000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)Problem Description哗啦啦村的食堂很奇怪，就是如果这个饭卡所剩金额低于5元的话，这个饭卡就不能刷了。也就是说，只要这个饭卡金额大于等于5元，就可以随便刷

2015-07-26 17:15:19 480

原创有向图的强联通分量Tarjan算法模版(hdu1269)

迷宫城堡Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9341 Accepted Submission(s): 4170Problem Description为了训练小希的方向感，Gardon建立了一座大城堡

2015-07-19 22:03:16 403

原创 DFS拓扑排序(算法导论思路)

#include#include#include#include#include#includeusing namespace std;const int maxn = 10005;int color[maxn]; //0代表白色,1代表灰色,2代表黑色vector vec[maxn]; //邻接表 int step; //全局变量代表总步数int stime[maxn];

2015-07-14 12:31:06 800

原创 DFS遍历图代码(算法导论思路实现)

#include#include#include#includeusing namespace std;const int maxn = 10005;int color[maxn]; //0代表白色,1代表灰色,2代表黑色vector vec[maxn]; //邻接表 int step; //全局变量代表总步数int stime[maxn]; //每个点遍历的时候的起始时间i

2015-07-14 10:57:58 519

原创 BFS遍历图代码

#include#include#include#include#includeusing namespace std;const int maxn = 1005;vector vec[maxn];queue que;bool vis[maxn];int step[maxn];void BFS(int s){ int i; int ele,ele1; que.p

2015-07-13 19:22:18 389

原创 POJ2492(A Bug's Life) && POJ1703(Find them, Catch them)带权(种类)并查集

A Bug's LifeTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 30559 Accepted: 9995DescriptionBackground Professor Hopper is researching the sexual beha

2015-07-09 19:31:51 369

原创 POJ1113(Wall) && Hdu1392(Surround the Trees) (计算几何--凸包)

WallTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 31844 Accepted: 10756DescriptionOnce upon a time there was a greedy King who ordered his chief Archi

2015-07-08 20:27:29 447

原创 POJ1330 Nearest Common Ancestors(最近公共祖先LCA 并查集+DFS)

Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21069 Accepted: 11050DescriptionA rooted tree is a well-known data structure in

2015-07-07 12:03:12 565

原创 POJ2387 Til the Cows Come Home(dijkstra + heap 或 SPFA)

Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 33716 Accepted: 11416DescriptionBessie is out in the field and wants to get back t

2015-07-06 17:07:56 427

原创 RMQ问题(士兵杀敌（三）)

士兵杀敌（三）时间限制：2000 ms | 内存限制：65535 KB难度：5描述南将军统率着N个士兵，士兵分别编号为1~N,南将军经常爱拿某一段编号内杀敌数最高的人与杀敌数最低的人进行比较，计算出两个人的杀敌数差值，用这种方法一方面能鼓舞杀敌数高的人，另一方面也算是批评杀敌数低的人，起到了很好的效果。所以，南将军经常问军师小工第i号士兵到第j号士兵

2015-07-05 16:03:47 343

原创 POJ1915 (Knight Moves) BFS

Knight MovesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 22994 Accepted: 10752DescriptionBackground Mr Somurolov, fabulous chess-gamer indeed, asse

2015-07-05 13:46:18 411

蒻菜_羊羊羊的专栏