传送门:51nod 1445 题意:
中文题,不多解释。要注意的是 DNA 每次变化都是变为可变的最小值,即处在第 i 行时,如果本行有多个值为 Y,则变为第一个为 Y 的。如果想变成其他的则必须把它之前的 Y 都变为 N&a…
传送门:SDUT 2155题目大意:
一个有 n个节点的有向图,开始时所有的点都被占领不能走,然后可以进行两种操作:
0. x ,把 x 点变的可以走
1. x y ,求点 x、y之间的最短路径需要输出 x 点是否被重复…
/*
从某一个点到任意一点的最短距离,该算法可以解决负边权问题,但是不能存在环的权值为负这种情况。这算法的复杂度O(点数*边数)
*/
#include <iostream>
#include<cstdio>
#include<cstring>
#define MAX 400003
#define VALUE 999999
using nam…
【题目来源】https://www.luogu.com.cn/problem/P9751https://www.acwing.com/problem/content/description/5313/【题目描述】 小 Z 打算在国庆假期期间搭乘旅游巴士去一处他向往已久的景点旅游。 旅游景点的地图共有 n 处地点,在这些地点之间连有 m 条道路。 其中…
题目来源:PAT (Advanced Level) Practice
The task is really simple: given N exits on a highway which forms a simple cycle, you are supposed to tell the shortest distance between any pair of exits.
Input Specification:
Each input file contains o…
题目来源:PAT (Advanced Level) Practice
There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any station and return it to any other stations in the city.…
题目来源:PAT (Advanced Level) Practice
A travelers map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a program to help a traveler to decide the shortest path between…
题目描述 The country is facing a terrible civil war----cities in the country are divided into two parts supporting different leaders. As a merchant, Mr. M does not pay attention to politics but he actually knows the severe situation, and your task is to he…
PAT A中30分答题常考题 1、Dijkstra算法DFS(重点)
(无负边权)单源最短路径问题万能通法,可以回溯路径,选取多条件最优路径
以在最短路径前提下的最小花费问题为例(其余条件根据题目变通&#…