algzjh的博客

1333: Funny Car RacingTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 497  Solved: 121[Submit][Status][Web Board]DescriptionThere is a funny car racing in a city with n junctions and m di

Two PathsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 153428/153428 K (Java/Others) Total Submission(s): 190 Accepted Submission(s): 113Problem Description You are given a undirected gr

测试题目： POJ3255///求次短路///使用优先队列Dijkstra算法///复杂度O(ElogV)///注意初始化///dist2[v]=min(dist[u]+e(u,v),dist2[u]+e(u,v))#include<iostream>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>

/*单源最短路SPFA时间复杂度O(kE)这个是队列实现，有时候改成栈实现会更加快，很容易修改这个复杂度是不定的*/#include&lt;iostream&gt;#include&lt;cstdio&gt;#include&lt;vector&gt;#include&lt;queue&gt;#include&lt;fstream&gt;#include&lt;cstring&gt;usi

/*单源最短路bellman_ford算法，复杂度O(VE)可以处理负边权图。可以判断是否存在负环回路。返回true，当且仅当图中不包含从源点可达的负权回路先初始化，然后加入所有边点的编号从1开始（从0开始简单修改就可以了）*/#include<iostream>#include<cstdio>#include<vector>#include<cstring>#include<

#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>using namespace std;typedef long long LL;const int MAXN=1e3+5;const int INF=0x3f3f3f3f;int dist[MAXN][MAXN];void init(int n

#include &amp;lt;iostream&amp;gt;#include &amp;lt;cstdio&amp;gt;#include &amp;lt;cstring&amp;gt;#include &amp;lt;cmath&amp;gt;#include &amp;lt;vector&amp;gt;#include &amp;lt;queue&amp;gt;#include &a

///单源最短路，Dijkstra算法，邻接矩阵形式，复杂度O(n^2)///求出源st到所有点的最短路径，传入图的顶点数和邻接矩阵cost[][]///返回各点的最短路径lowcost[]，路径pre[]，pre[i]记录st到i路径上的父结点，pre[st]=-1///可以更改路径权类型，但权值必须为非负///点编号从0开始#include<iostream>#include<cst

Remmarguts’ DateTime Limit: 4000MS Memory Limit: 65536K Total Submissions: 30805 Accepted: 8405 Description“Good man never makes girls wait or breaks an appointment!” said the mandarin du

1092: BarricadeSubmit Page Summary Time Limit: 1 Sec Memory Limit: 32 Mb Submitted: 309 Solved: 102 Description GBQC国一共有N个城市，标号分别为1, 2, …, N。N个城市间一共有M条单向通行的道路。不幸的是，GBQC国的城市1连续暴雨，使得

畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 53333 Accepted Submission(s): 19918Problem Description 某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路

Jimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even nicer, his office

Problem B | limit 5 secondsBones’s BatteryBones is investigating what electric shuttle is appropriate for his mom’s school district vehicle. Each school has a charging station. It is important that a

本题是一部战争大片 —— 你需要从己方大本营出发，一路攻城略地杀到敌方大本营。首先时间就是生命，所以你必须选择合适的路径，以最快的速度占领敌方大本营。当这样的路径不唯一时，要求选择可以沿途解放最多城镇的路径。若这样的路径也不唯一，则选择可以有效杀伤最多敌军的路径。输入格式：输入第一行给出2个正整数N（2 &lt;= N &lt;= 200，城镇总数）和K（城镇间道路条数），以及己方大本营和...