MiniSheep_CS-CSDN博客

原创 POJ1157 LITTLE SHOP OF FLOWERS(动态规划DP)

LITTLE SHOP OF FLOWERSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19011 Accepted: 8791DescriptionYou want to arrange the window of your flower shop

2015-04-28 12:09:28 934

原创 POJ1463 Strategic game(树形DP)

Strategic gameTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 6722 Accepted: 3095DescriptionBob enjoys playing computer games, especially strategic game

2015-04-27 20:20:51 1433 1

原创 POJ2342 Anniversary party(树形DP)

Anniversary partyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4850 Accepted: 2751DescriptionThere is going to be a party to celebrate the 80-th Anniv

2015-04-27 18:50:21 381

原创 POJ2251 Dungeon Master(搜索BFS)

Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18557 Accepted: 7216DescriptionYou are trapped in a 3D dungeon and need to find the quicke

2015-04-16 19:58:34 354

原创 POJ1088 滑雪(递归 + 记忆化搜索)

滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 80871 Accepted: 30152DescriptionMichael喜欢滑雪百这并不奇怪，因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等

2015-04-16 11:55:02 596

原创 POJ1837 Balance(动态规划)

BalanceTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 11431 Accepted: 7127DescriptionGigel has a strange "balance" and he wants to poise it. Actually,

2015-04-13 19:58:09 338

原创 POJ1276 Cash Machine(动态规划)

Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28982 Accepted: 10375DescriptionA Bank plans to install a machine for cash withdrawal. The m

2015-04-13 19:51:13 438

原创算法导论(LCS最长公共子序列)

真动态规划版(自底而下):#includeusing namespace std;const int maxn = 10001;int m,n;char b[maxn][maxn]; //回溯时保存路径int c[maxn][maxn]; //最长子序列void LCS(char *x,char *y){ int i,j; for(i=0;i<=m;i++)

2015-04-13 09:40:42 418

转载哈希表的C++实现

#include using namespace std; typedef int KeyType; //设关键字域为整形,需要修改类型时，只需修改这里就可以 const int NULLKEY=0; //NULLKEY表示该位置无值 int c=0; //用来统计冲突次数 struct Elemtype //

2015-04-06 15:42:02 467

原创 hdu1754 I Hate It(线段树)

I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 44413 Accepted Submission(s): 17437Problem Description很多学校流行一种比较的习惯。老师们很

2015-04-02 13:11:02 361

原创 POJ3020 Antenna Placement(二分图匹配匈牙利算法)

Antenna PlacementTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7044 Accepted: 3498DescriptionThe Global Aerial Research Centre has been allotted the tas

2015-03-29 18:03:56 452

原创 HDU2063 过山车(二分图匹配-匈牙利算法模版题)

过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12822 Accepted Submission(s): 5628Problem DescriptionRPG girls今天和大家一起去游乐场玩，终于可

2015-03-29 15:07:38 520

原创 POJ2367(拓扑排序)

Genealogical treeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3233 Accepted: 2182 Special JudgeDescriptionThe system of Martians' blood relations i

2015-03-25 15:21:40 455

原创 POJ2485 Highways(prim和Kruskal最小生成树两种解法)

HighwaysTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23459 Accepted: 10850DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately,

2015-03-19 11:17:45 519

原创 POJ1789 Truck History(prim最小生成树)

Truck HistoryTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19866 Accepted: 7676DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types

2015-03-19 10:06:33 366

原创 POJ Out of Hay(2395 prim最小生成树)

Out of HayTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11814 Accepted: 4628DescriptionThe cows have run out of hay, a horrible event that must be remed

2015-03-18 22:30:36 389

原创 POJ2240 Arbitrage(floyd算法的变形运用)

ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16745 Accepted: 7035DescriptionArbitrage is the use of discrepancies in currency exchange rates

2015-03-18 13:58:09 397

原创 16进制转8进制(较为巧妙的做法)

#include#includeusing namespace std;const int maxn = 10011;int main(){ int T; cin>>T; while(T--) { string a,b; int c[maxn]; int i; b = "";

2015-03-17 19:00:56 706

原创 POJ1125 Stockbroker Grapevine(最短路floyd算法)

Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28312 Accepted: 15711DescriptionStockbrokers are known to overreact to rumours. You

2015-03-17 16:39:32 418

原创 POJ2253 Frogger(floyd最短路算法)

FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 27654 Accepted: 8999DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenl

2015-03-17 15:01:14 289

原创 POJ1062 昂贵的聘礼(dijkstra最短路)

昂贵的聘礼Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 38753Accepted: 11216Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿

2015-03-16 18:31:07 417

原创 POJ3259 Wormholes(Bellman-ford 负环)

WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 33194 Accepted: 12085DescriptionWhile exploring his many farms, Farmer John has discovered a

2015-03-15 14:09:13 333

原创 POJ1860 Currency Exchange(Bellman-ford的变形)

Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 21433 Accepted: 7680DescriptionSeveral currency exchange points are working in our city

2015-03-15 11:05:41 437

原创 POJ1573 Robot Motion(模拟)

Robot MotionTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11082 Accepted: 5388DescriptionA robot has been programmed to follow the instructions

2015-03-11 22:21:08 466

原创 POJ1068 Parencodings(模拟)

ParencodingsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20763 Accepted: 12480DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses.

2015-03-11 14:01:45 414

原创 POJ3295 Tautology(栈和枚举的应用)

TautologyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10073 Accepted: 3832DescriptionWFF 'N PROOF is a logic game played with dice. Each die has si

2015-03-10 17:49:24 403

原创 POJ2586 Y2K Accounting Bug(贪心)

Y2K Accounting BugTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10975 Accepted: 5520DescriptionAccounting for Computer Machinists (ACM) has sufferred

2015-03-09 20:36:55 482

原创 POJ1328 Radar Installation(区间覆盖)

Radar InstallationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 57054 Accepted: 12867DescriptionAssume the coasting is an infinite straight line. Land

2015-03-09 15:21:12 363

原创线段区间覆盖代码

题目:区间长度8，可选的覆盖线段[2,6],[1,4],[3,6],[3,7],[6,8],[2,4],[3,5],求最小的能覆盖全部区间的段数.自己写的代码:#include#include#includeusing namespace std;const int maxn = 1000;struct point{ int start;

2015-03-08 21:58:08 362

转载区间覆盖问题(贪心)

1）区间完全覆盖问题问题描述：给定一个长度为m的区间，再给出n条线段的起点和终点（注意这里是闭区间），求最少使用多少条线段可以将整个区间完全覆盖样例：区间长度8，可选的覆盖线段[2,6],[1,4],[3,6],[3,7],[6,8],[2,4],[3,5]解题过程:1将每一个区间按照左端点递增顺序排列，拍完序后为[1,4]，[2,4]，[2,6]，[3,5

2015-03-08 20:09:20 530

转载简明Vim练级攻略

文章内容如下：Vim的学习曲线相当的大（参看各种文本编辑器的学习曲线），所以，如果你一开始看到的是一大堆VIM的命令分类，你一定会对这个编辑器失去兴趣的。你想以最快的速度学习人类史上最好的文本编辑器VIM吗？你先得懂得如何在VIM幸存下来，然后一点一点地学习各种戏法。Vim the Six Billion Dollar editorBetter, Stronger,

2015-02-28 21:19:02 435

原创计算几何--两圆的位置关系(求交点个数及交点坐标)

两圆相交。假定圆心分别为C1和C2,半径为r1和r2,圆心距为d，根据余弦定理可以算出C1C2到C1P1的角da,根据向量C1C2的极角a,加减da就可以得到C1P1和C1P2的极角。有了极角，就可以很方便地计算出P1和P2的坐标了。代码如下:#include#include#includeusing namespace std;struct Point{ double x,

2015-02-28 13:16:24 6502 3

原创 Uva11178计算几何 Morley's Theorem(Morley定理)

Morley’s TheoremInput: Standard InputOutput: Standard Output Morley’s theorem states that that the lines trisecting the angles of an arbitrary plane triangle meet at the vertices of an equilat

2015-02-26 15:53:32 476

转载一步一步理解线段树

一概述线段树，类似区间树，是一个完全二叉树，它在各个节点保存一条线段（数组中的一段子数组），主要用于高效解决连续区间的动态查询问题，由于二叉结构的特性，它基本能保持每个操作的复杂度为O(logn)。线段树的每个节点表示一个区间，子节点则分别表示父节点的左右半区间，例如父亲的区间是[a,b]，那么(c=(a+b)/2)左儿子的区间是[a,c]，右儿子的区间是[c+1,b]。

2015-02-15 19:21:10 362

原创 hdu1166 敌兵布阵（线段树入门题）

#includeusing namespace std;const int maxn = 50001;struct tree{ int left,right; int sum;}node;tree t[maxn * 3]; //结点数int a[maxn]; //元素的值void build(int num,int left,int right) //num表示序号

2015-02-15 17:31:35 493

原创 STL之priority_queue的使用

priority_queue说明:优先队列的实现就不说了，运用的是堆的知识，前几篇博客已经有提到。现在讲讲如何在比赛的时候直接用STL里面的队列头文件中的priority_queue来帮我们解题。下文有两种使用方法，一种是运用#include中的greater和less来帮我们实现数据的排序。还有一种是自定义，也就是自己写排序方法让priority_queue来根据我们排序方法来排序。代码

2015-02-13 18:02:12 512

原创求解无向图的割点和桥

无向图的割点和桥割点和桥的概念:对于无向图G,如果删除某个点u后,连通分量数目增加(本来为一个连通集，现在变为多个)，称u为图的割点。对于连通图，割点就是删除之后不再连通的点。当然了，桥也同理，只不过桥是边，也称为割边，如果删掉(u,v)之后连通分量数目增加，那么我们称(u,v)这条边为桥(割边)。求割点和桥的方法:①很容易想到的，暴力每个结点，然后用DFS判断连通分量是否增加，时

2015-02-11 20:19:45 827

原创 Kruskal最小生成树算法

#include#include#includeusing namespace std;const int maxn = 1001;int fa[maxn];int N,M;struct edge{ int x,y,w; edge(int x = 0,int y = 0,int w = 0):x(x),y(y),w(w) {}}e[maxn];bool cmp(e

2015-02-09 20:52:14 506

原创网络流之最大流(Edmonds-Karp算法和Dinic算法)

Ford-Fulkerson算法的基本思路:Ford-Fulkerson算法是求解最大流的基本算法，主要思想是，每次在残量网络中寻找一条从源到汇的路径(称为增广路径),并沿着这条路径增加流量，该算法的改进为Edmonds-Karp算法，与Ford-Fulkerson算法基本无异。Edmonds-karp算法的复杂度为O(|V|*|E|²),在稀疏图(边少点多)中可以得到不错的运行效率。

2015-02-07 14:47:10 1320

原创 bellman-ford算法(判断是否存在负环)

Bellman-ford算法的一个重要应用是判负环。在迭代n-1次后如果还可以进行松弛操作，说明一定存在负环。如果采用队列实现，那么当某个结点入队了n次时可以判断出存在负环，代码如下:#include#include#include#include#include#includeusing namespace std;const int maxn = 1001;struct E

2015-02-04 19:57:41 4566

空空如也

空空如也