猿的进化

http://acm.hdu.edu.cn/showproblem.php?pid=1010Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 89573    Accepted

Windows 10Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 754    Accepted Submission(s): 221Problem DescriptionLong long ago, th

http://poj.org/problem?id=1222题意：5*6矩阵中有30个灯，操作一个灯，周围的上下左右四个灯会发生相应变化 即由灭变亮，由亮变灭，如何操     作使灯全灭？     EXTENDED LIGHTS OUTTime Limit: 1000MS Memory Limit: 10000K

B - Dungeon MasterTime Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2251DescriptionYou are trapped in a 3D dungeon and need t

NCPC 2015Problem AAdjoin the NetworksProblem ID: adjoinWikimedia, cc-by-saOne day your boss explains to you that he has abunch of computer networks that are currently unreachablefrom eac

Sparse GraphTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 83    Accepted Submission(s): 27Problem DescriptionIn graph theory

E. Paint it really, really dark graytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputI see a pink boar and I

D. Directed Roadstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder and Chris the Baboon has exp

Herbs GatheringTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 548    Accepted Submission(s): 104Problem DescriptionCollecting o

This story happened on the background of Star Trek. Spock, the deputy captain of Starship Enterprise, fell into Klingon’s trick and was held as prisoner on their mother planet Qo’noS. The capt

题意很有意思，给了n段路，每段路长度不同，你有一辆车最多可以提供E的能量，你的车有四个档，最多换k次档Assist Level    0  1  2  3 Assist Power  0  4  8 110档花费能量0，走的路程长度为0,1档花费1能量，走得最大路程为4.... ，每段路用一个档，如果这个档不能使你走完这段路，那么只能自己蹬，如果超过这段路长度，超过部分不计算到下一

B - AntonidasTime Limit:4000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 5469Appoint description: System Crawler  (Oct 19, 2016 12:13:28 PM

点击打开题目链接B题题意，在一个n*m的宫殿里，公主要逃出宫殿，出口位置用%表示，@表示公主位置，$表示士兵，#表示墙，. 表示空地，士兵和公主都可以在单位时间内向相邻的格子走一步，如果公主和士兵走到了一个格子甚至是出口位置，那么公主就会被抓住，问公主能否成功逃出宫殿  这个题计算公主到达出口的时间是否小于任何一个士兵到达出口的时间就好了，但是由于士兵多，出口唯一，所以我们以出口为起点

Auxiliary SetTime Limit: 9000/4500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 516    Accepted Submission(s): 148Problem DescriptionGiven a rooted

Counting CliquesTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 75    Accepted Submission(s): 0Problem DescriptionA clique is a

hdu5118 GRE Words Once More!Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 265 Accepted Submission(s): 48Problem Description Now Matt i

hdu6060 题意：给出一颗n个节点的树，要求将2-n号节点分成k部分，然后再将每一部分加上1号节点联通的最小花费，定义为每一部分的val，为其在原图上的最小斯坦纳树，问总的val最大可能是多少。把1看成整棵树的根. 问题相当于把2∼n每个点一个[1,k]的标号. 然后根据最小斯坦纳树的定义(x,fa(x) )，(x,fa(​x)​​ ) 这条边的贡献是 x 子树内不同标号的个数目dif(​i)

传送门 题意：给一个金字型塔的数列，第一行一个0，第二行两个1，。。。第6行6个5，现在金字塔数字打乱了，你只能移动0这个数字，只能向左上右上左下右下走，问在20步内能否回到原来状态。 一共21个数，每个有6种状态，没办法用一个 [21][6]维的数组记录状态，所以我们要用Hash记录状态，每个位置6种状态，那么最大是6^21的数字，long long可以存的下的。我们用bfs进行搜索，给两个起

Ancient GoTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 799    Accepted Submission(s): 283Problem DescriptionYu Zhou likes to

J - Cleaner RobotTime Limit:2000MS     Memory Limit:524288KB     64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 589JDescriptionMasha has recently bought a cleaner

India and China OriginsTime Limit: 2000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 628    Accepted Submission(s): 212Problem DescriptionA lo

http://acm.hdu.edu.cn/showproblem.php?pid=1198Farm IrrigationTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7199    Accepted Subm

http://poj.org/statusFliptileTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5366 Accepted: 2038DescriptionFarmer John knows that an intelle

http://acm.hdu.edu.cn/showproblem.php?pid=2181这是一个dfs搜索题目，难点在于剪枝，以及路径还原；下面是给出代码及其详解/*回溯方法的深度理解9->3->2->13->5->headpre[9]=3;pre[3]=2;pre[2]=13;pre[13]=5;pre[5]=head;找到头后，开始输出head，然后回溯，输出5，回

http://acm.hdu.edu.cn/showproblem.php?pid=2102自己的代码  就是 不A  好伤心，借鉴 大神代码一下本题是一个三 维bfs，骑士走的最近路径小于T，就能救回公主下面是ac代码#include #include #include #include using namespace std;#define inf (0x7f7f7

http://poj.org/problem?id=1426Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22375 Accepted: 9190 Special JudgeDescription

http://poj.org/problem?id=3984以前做过求路径长度的题，d[  now ]=d[ from ]+1;;now   我们 要求路径，根据 距离的启示，我们把  now的坐标 和 from 的坐标联系起来；因此 ，我们 用到结构体， mp[tot ] .x = x,   mp[   tot  ].y=  y,  mp[  tot] . next  =now .s

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

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

M - 非常可乐Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1495Description大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可

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

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

），英雄互娱（杭州）HunterTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1671    Accepted Submission(s): 504Problem Description

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,

I - Fire GameTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit Status Practice FZU 2150DescriptionFat brother and Maze are playing a kind of specia

传送门 汉语题不解释#include <set>#include <map>#include <stack>#include <queue>#include <math.h>#include <vector>#include <string>#include <stdio.h>#include <iostream>#include <stdlib.h>#include <str