BZOJ 1050 [HAOI2006]旅行comf
动点spfa,并不知道复杂度多少。#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 1001050;
int dist[maxn]
原创
2017-04-20 09:58:57 ·
385 阅读 ·
0 评论