醉酒诗人的博客

1076 Forwards on Weibo (30分)题目链接法一：邻接矩阵法#include<iostream>#include<queue>using namespace std;const int maxn = 1010;int Graph[maxn][maxn] = {0};int n, l; //邻接矩阵版本 struct Node{...

1034 Head of a Gang (30分)题目链接思路：图的深搜。#include<iostream>#include<map>#include<cstring>#include<algorithm>using namespace std;const int maxn = 2005;const int inf = 0x3...

1874 畅通工程续题目链接Problem Description某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不好，每次要从一个城镇到另一个城镇时，都有许多种道路方案可以选择，而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在，已知起点和终点，请你计算出要从起点到终点，最短需要行走多少距离。Input本题目包含多组数据，请处理到文件结束。每组数据...

Fire Net链接Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18352 Accepted Submission(s): 11191Problem DescriptionSuppose that we have a ...

Red and Black链接Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33213 Accepted Submission(s): 20143Problem DescriptionThere is a rectang...

Oil Deposits链接Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 57905 Accepted Submission(s): 33183Problem DescriptionThe GeoSurvComp geo...