猿的进化

http://acm.hdu.edu.cn/showproblem.php?pid=1599find the mincost routeTime Limit: 1000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3358    Accepted S

题目大意：给出n个点和m条边，接着是m条边，代表从牛a到牛b需要花费c时间，现在所有牛要到牛x那里去参加聚会，并且所有牛参加聚会后还要回来，给你牛x，除了牛x之外的牛，他们都有一个参加聚会并且回来的最短时间，从这些最短时间里找出一个最大值输出D - Silver Cow PartyTime Limit:2000MS     Memory Limit:65536KB     64bi

http://acm.hdu.edu.cn/showproblem.php?pid=2063欢迎参加——每周六晚的BestCoder（有米！）过山车Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submiss

Drainage DitchesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12550    Accepted Submission(s): 5975Problem DescriptionEvery ti

FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 32122 Accepted: 10351DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Sudden

Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 26357 Accepted: 7011DescriptionBackground Hugo Heavy is happy. After the breakdown of the Cargolifter project he

Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16272 Accepted: 7448DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently

DiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12634 Accepted: 5801DescriptionCows are such finicky eaters. Each cow has a preference for certain

Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20302 Accepted: 10296DescriptionOn a grid map there are n little men and n houses. In each uni

Farm TourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13920 Accepted: 5292DescriptionWhen FJ's friends visit him on the farm, he likes to show them a

Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8765 Accepted: 4931DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participa

MPI MaelstromTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7445 Accepted: 4533DescriptionBIT has recently taken delivery of their new supercomputer, a

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

Invitation CardsTime Limit: 8000MS Memory Limit: 262144KTotal Submissions: 23260 Accepted: 7657DescriptionIn the age of television, not many people attend theater

Given a sequence of integers, a1, a2,..., an , we define its sign matrix S such that, for 1ijn , Sij = `` + " if ai +...+ aj > 0 ; Sij = `` - " ifai +...+ aj  ; and Sij = ``0" otherwise.For ex

InstrusiveTime Limit: 3000/1500 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1564    Accepted Submission(s): 465Problem DescriptionThe legendary mercenary Soli

You are given a weighted directed graph with n vertices and m edges. Each cycle in the graph has aweight, which equals to sum of its edges. There are so many cycles in the graph with different weigh

A - Road ConstructionTime Limit:8000MS     Memory Limit:65536KB     64bit IO Format:%lld & %lluSubmit StatusDescriptionKing Mercer is the king of ACM kingdom. There are one capital a

D - Fibonacci TreeTime Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescription　　Coach Pang is interested in Fibonacci numbers while Uncle Ya

http://poj.org/problem?id=3126Prime PathTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14460 Accepted: 8159DescriptionThe ministers of the

Children's DiningTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4429 Accepted: 637 Special JudgeDescriptionUsually children in kindergarten like to

#include#includeconst int MAXN=111;using namespace std;stackS;int edge[MAXN][MAXN];int n,m;void dfs(int x){ S.push(x); for(int i=1;i<=n;i++){ if(edge[x][i]>0){ edg

B - FroggerTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2253DescriptionFreddy Frog is sitting on a stone in the middle

给出一张无向图，求一个最小环并输出路径。说说我的感觉：包含点 i 和点 j 的最小环，我们可以看成是 i 到 j 之间的最短路和次短路的组合，通过 floyd 可求任意两点之间的最短距离，那么我们只要找到最短路径外的一条最短路来保证 i 和 j 之间可达即可。在做 floyd 循环的同时，我们以 环权值 最小（最短路权值+次短路权值=最小环权值）为标准，一直更新每个点的前驱，也就是记录 i 到

Little Chris is participating in a graph cutting contest. He's a pro. The time has come to test his skills to the fullest.Chris is given a simple undirected connected graph with n vertices (numbered

Problem ITeen Girl Squad Input: Standard Input Output: Standard Output You are part of a group of n teenage girls armed with cellphones. You have some news you want to tell everyone in the gro

一体”全攻略！ 招聘——巴卡斯科技（杭州）、英雄互娱（杭州）奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6340    Accepted Submission(s): 2789

A - Fire NetTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1045DescriptionSuppose that we have a square city with straight

FoodTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4364    Accepted Submission(s): 1475Problem Description　　You, a part-time di

Dual Core CPUTime Limit: 15000MS Memory Limit: 131072KTotal Submissions: 22059 Accepted: 9587Case Time Limit: 5000MSDescriptionAs more and more computers ar

Saving Tang MonkTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1889    Accepted Submission(s): 671Problem Description《Journey t

N - Find a wayTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2612DescriptionPass a year learning in Hangzhou, yifenfei arr

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=65959#problem/J发个题目链接吧，文章复制不成功，就是给一个二维图，#  .    F   J  ,# 表示墙，.表示路，F表示火，J表示人，二者都是每次移动一格，（上下左右），F可能会有多个，问人是否可以走出来，只要走到边就算走出来了，解决，bfs搜索，队列实现

K - 迷宫问题Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3984Description定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0,

C - How Many Maos Does the Guanxi WorthTime Limit:1000MS     Memory Limit:512000KB     64bit IO Format:%I64d & %I64uSubmit StatusDescription"Guanxi" is a very important word in Chi

B - Cat VS DogTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 3829DescriptionThe zoo have N cats and M dogs, today there are

A - The Unique MSTTime Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1679DescriptionGiven a connected undirected graph, tell

Equivalent SetsTime Limit: 12000/4000 MS (Java/Others)    Memory Limit: 104857/104857 K (Java/Others)Total Submission(s): 3751    Accepted Submission(s): 1308Problem DescriptionTo prov

D - 棋盘游戏Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1281Description小希和Gardon在玩一个游戏：对一个N*M的棋盘，在格子里放尽量多的一些国际象棋里面的“车”，并且使得他们

C - CoursesTime Limit:10000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1083DescriptionConsider a group of N students and P courses. Ea