题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5336题意：给你一个r*c的网格，有的网格为空，有的有水，再给出一个爆炸点，从这个点向四周爆出四个水滴，若碰到水则融为一体，若碰到其他水滴直接跑过去互不影响，每秒可跑一格，若水中水滴数量超过4则爆开，问T秒后网格的状态是怎样的。代码：#include <stdio.h>#includ
题目： range works and as a result, there are many history-lovers
迷宫问题以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。要求：（1）首先实现一个以链表作存储结构的栈类型，然后编写一个求解迷宫的非递归程序。求得的通路以三元组(i,j,d)的形式输出，其中(i,j)指示迷宫中的一个坐标，d表示走到下一坐标的方向。（2）测试几组数据，数据的规模由小变大，即网格越来越小，
Problem B: Fire! Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze. Given Jo
终于过了这道题做的第一道位压缩http://acm.hdu.edu.cn/showproblem.php?pid=1429#include#include#include#include#include#include#include#include#includeusing namespace std;int n, m, t;int
http://acm.hdu.edu.cn/showproblem.php?pid=2612两次bfs， 记录到每个KFC的最短时间。选取最短时间。#include #include #include #include #include #include #include #include #include #include #include #include
http://acm.fzu.edu.cn/problem.php?pid=2150#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing
http://poj.org/problem?id=3984#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include
http://poj.org/problem?id=2251#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #i
http://acm.hdu.edu.cn/showproblem.php?pid=1253这道水题#include #include #include #include #include #include #include #include #include #include #inclu
http://poj.org/problem?id=3669广搜#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusin
http://acm.hdu.edu.cn/showproblem.php?pid=1195bfs 加1 减 1 交换 ，三个方式#include#include#include#include#include#include#include#include#include#include#include#include#include#inclu
bfs 六种状态 #include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespac
三维的BFS#include #include #include #include #include #include #include #include #include #include using namespace std;char str[10];int n;int sx,sy,sz;int ex,ey,ez;int ans ;int vis[3
http://acm.hdu.edu.cn/showproblem.php?pid=2102#include #include #include #include #include #include #include #include #include #include using namespace std;struct pp{ int w,x,y;
广度优先搜索模板题
广搜简单题#include #include #include #include #include #include #include using namespace std;int n,m;int vis[100010];int main (){ while (scanf("%d%d",&n,&m)!=EOF) { for (int
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号
