我和我的三只猫

Ikki's Story IV - Panda's TrickTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 7821 Accepted: 2892Descriptionliympanda, one of Ikki’s friend, likes playing games with Ikki. Today af

迪杰斯特拉（大神链接）：点击打开链接其基本思想是，设置顶点集合S并不断地作贪心选择来扩充这个集合。一个顶点属于集合S当且仅当从源到该顶点的最短路径长度已知。初始时，S中仅含有源。设u是G的某一个顶点，把从源到u且中间只经过S中顶点的路称为从源到u的特殊路径，并用数组dist记录当前每个顶点所对应的最短特殊路径长度。Dijkstra算法每次从V-S中取出具有最短特殊路长度的顶点u，将u添

畅通工程续Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 21028    Accepted Submission(s): 7310Problem Description某省自从实行了很多年的畅通工程计划后，终于修建了

Dungeon Master You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one

AVL TreeTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 642    Accepted Submission(s): 310Problem DescriptionAn AVL tree is a kind of balanced b...

B - Tree RecoveryPOJ - 2255 Little Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes.This is an ex...

很用心写的这篇博客，反正是花了好几天。前言：要在自然数，且所有的数不大于30000的范围内讨论一个问题：现在已知n条线段，把端点依次输入告诉你，然后有m个（多次）询问，每个询问输入一个点，要求这个点在多少条线段上出现过；最暴力的解法当然就是读一个点，就把所有线段比一下，看看在不在线段中；但是每次询问都要把n条线段查一次，那么m次询问，就要运算m*n次，复杂度就是O(m*n)假如m是30000，那么...

I Hate It题目链接：点击打开链接Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 74300    Accepted Submission(s): 28675Problem Description很多学校流行一种比较的习惯。老师们很喜...

hdu  1166题目链接：点击打开链接敌兵布阵Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 87939    Accepted Submission(s): 37022Problem DescriptionC国的死对头A国这段时间正在进...

最短路Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 57858    Accepted Submission(s): 25500Problem Description在每年的校赛里，所有进入决赛的同

ArbitrageHDU - 1217 Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Do...

Til the Cows Come Home(POJ 2387)Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 51512 Accepted: 17411DescriptionBessie is out in the field and wants to get back to the barn to ge

Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 34975 Accepted: 19417DescriptionStockbrokers are known to overreact to rumours. You have been contracted to d

输入一个n个结点的无根树的各条边，并指定一个根结点，要求把该树转化为有根树，输出各个结点的父节点编号。n<=10^6. //输入无根树的结点个数n，输入n-1条边(u, v)，输入欲指定的根的编号root，建立以root为根的树  /*可变长数组 一个有maxn行 当时每行长度可以不同的数组       用于表示树中结点间的关系  */主程序中设置p[root]=-1(表示根结点不存在)，然...

畅通工程续Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 50210    Accepted Submission(s): 18728Problem Description某省自从实行了很多年的畅通工

ArbitrageTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7630    Accepted Submission(s): 3537Problem DescriptionArbitrage is

HDU TodayTime Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 27455    Accepted Submission(s): 6696Problem Description经过锦囊相助，海东集

最短路Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 57858    Accepted Submission(s): 25500Problem Description在每年的校赛里，所有进入决赛的同

Bakery Masha wants to open her own bakery and bake muffins in one of the n cities numbered from 1 to n. There are m bidirectional roads, each of whose connects some pair of cities.To bake muff

                                  F - Minimum Transport Cost HDU - 1385 These are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is so...

FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 42402 Accepted: 13535DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sittin...

现在有一棵合法的二叉树，树的节点都是用数字表示，现在给定这棵树上所有的父子关系，求这棵树的高度输入描述:输入的第一行表示节点的个数n（1 ≤ n ≤ 1000，节点的编号为0到n-1）组成，下面是n-1行，每行有两个整数，第一个数表示父节点的编号，第二个数表示子节点的编号输出描述:输出树的高度，为一个整数示例1输入50 10 21 31 4输出3#include<iostream...