紫芝的博客

Floyd–Warshall（简称Floyd算法）是一种著名的解决任意两点间的最短路径（All Paris Shortest Paths，APSP）的算法。从表面上粗看，Floyd算法是一个非常简单的三重循环，而且纯粹的Floyd算法的循环体内的语句也十分简洁。我认为，正是由于“Floyd算法是一种动态规划（Dynamic Programming）算法”的本质，才导致了Floyd算法如此精妙。...

Machine ScheduleTime Limit: 1000MS   Memory Limit: 10000K Total Submissions: 17026   Accepted: 7211 DescriptionAs we all know, machine scheduling is a very classical problem in com...

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

奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13984    Accepted Submission(s): 6102Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定...

POJ2195 Going Home 最小费用最大流Going HomeTime Limit: 1000MS   Memory Limit: 65536K Total Submissions: 25567   Accepted: 12838 DescriptionOn a grid map there are n little men and n hou...

POJ 2195 Going Home 二分图的最大权匹配Going HomeTime Limit: 1000MS   Memory Limit: 65536K Total Submissions: 25567   Accepted: 12838 DescriptionOn a grid map there are n little men and n ...

POJ2516-Minimum CostDearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy ...

A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 0...

 Island Transport  　　In the vast waters far far away, there are many islands. People are living on the islands, and all the transport among the islands relies on the ships. 　　You have a transportat...

　　You, the head of Department of Security, recently received a top-secret information that a group of terrorists is planning to transport some WMD 1 from one city (the source) to another one (the dest...

COURSESTime Limit: 1000MS   Memory Limit: 10000K Total Submissions: 25820   Accepted: 9957 DescriptionConsider a group of N students and P courses. Each student visits zero, one or...

 The Perfect StallTime Limit: 1000MS   Memory Limit: 10000K Total Submissions: 29041   Accepted: 12738 DescriptionFarmer John completed his new barn just last week, complete with a...

AsteroidsTime Limit: 1000MS   Memory Limit: 65536K Total Submissions: 26508   Accepted: 14321 DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field i...

点击打开链接C. Cut 'em all!time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou're given a tree with n vertices.Your task is to determine the maximum poss...

复原二叉树时间限制: 1 Sec  内存限制: 128 MB题目描述小明在做数据结构的作业，其中一题是给你一棵二叉树的前序遍历和中序遍历结果，要求你写出这棵二叉树的后序遍历结果。输入输入包含多组测试数据。每组输入包含两个字符串，分别表示二叉树的前序遍历和中序遍历结果。每个字符串由不重复的大写字母组成。输出对于每组输入，输出对应的二叉树的后序遍历结果。样例输入D...

点击打开链接F. The Meeting Place Cannot Be Changedtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetr is a detective in Braginsk. So...

拓扑排序    一个工程常被分为多个小的子工程，这些子工程被称为活动（Activity)，在有向图中若以顶点表示活动，有向边表示活动之间的先后关系，这样的图简称为AOV网。在AOV网中为了更好地完成工程，必须满足活动之间先后关系，需要将各活动排一个先后次序即为拓扑排序• 1.从有向图中选取一个没有前驱的顶点，并输出之；•2.从有向图中删去此顶点以及所有以它为尾的弧；•重复上述两步，直...

排名时间限制: 1 Sec 内存限制: 128 MB题目描述有 N 个比赛队（1<=N<=500），编号依次为 1，2，3……N 进行比赛，比赛结束后，裁判委员会要将所有参赛队伍从前往后依次排名，但现在裁判委员会不能直接获得每个队的比赛成绩，只知道每场比赛的结果，即 P1 赢 P2，用 P1，P2 表示，排名时 P1 在 P2之前。现在请你编程序确定排名。符合条件的排名...

欧拉回路Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18525    Accepted Submission(s): 7193Problem Description欧拉回路是指不令笔离开纸面，可画过图中每条边仅一次，且可以...

图的存储 — 邻接矩阵 在树的问题中，邻接矩阵是空间、时间的极大浪费。 假设树的结点个数为 N = 100000。建立邻接矩阵需要空间为 1e5*1e5 但是由于只有 N - 1 条边，所以在邻接矩阵中只有 100000 - 1 个有效 信息。 即只利用了邻接矩阵的 0.00001%，剩余空间全部被浪费。图的存储 — 邻接表 邻接表是最常用存储结构之一。 但是 vector(动...

基本概念1.二分图：二分图又称作二部图，是图论中的一种特殊模型。 设G=(V,E)是一个无向图，如果顶点V可分割为两个互不相交的子集(A,B)，并且图中的每条边（i，j）所关联的两个顶点i和j分别属于这两个不同的顶点集(i in A,j in B)，则称图G为一个二分图。 无向图G为二分图的充分必要条件是，G至少有两个顶点，且其所有回路的长度均为偶数。 2.最大匹配：给定一个二...

THE 30th ACM/ICPC ASIA REGIONAL 2005 HANGZHOU SITEOnsite Contest SessionProblem C: CellsScientists are conducting research on the behavior of a newly discovered Agamic Cellular Microbe. This spe...