来道例题吧:hdu1874
AC代码如下(复杂度为O(n^3),小心TLE,优选Dijkstra算法):
记住!!K一定要放在最外层!!
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
const int maxn=205;
int n,m;
int mp[maxn][maxn];
int main(){
while(cin>>n>>m
来道例题吧:hdu1874
AC代码如下(复杂度为O(n^3),小心TLE,优选Dijkstra算法):
记住!!K一定要放在最外层!!
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
const int maxn=205;
int n,m;
int mp[maxn][maxn];
int main(){
while(cin>>n>>m