CF-GYM102222F Moving On

https://codeforces.com/gym/102222/problem/F

签到题
naive floyd

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cfloat>
using namespace std;
#define rep(i, j, k) for (int i = j; i <= k;++i)
#define mxn 205
long long f[mxn][mxn][mxn];
int val[mxn];
int id[mxn];
// int rnk[mxn];
int n,q;
int b[mxn];
bool cmp(int a, int b)
{
	return val[a] < val[b];
}
int main()
{
	int T,u,v,w;
	cin >> T;
	for (int csn = 1; csn <= T;++csn)
	{
		printf("Case #%d:\n", csn);
		cin >> n >> q;
		// memset(f, 0x3f, sizeof(f));
		rep(i, 1, n) cin >> val[i], id[i] = i, b[i]=val[i];
		sort(id + 1, id + 1 + n, cmp);
		sort(b + 1, b + 1 + n);
		// rep(i, 1, n) rnk[id[i]] = i;
		rep(i, 1, n) rep(j, 1, n) cin >> f[0][i][j];
		rep(i, 1, n) rep(j, 1, n) rep(k, 1, n) 
		{
			f[i][j][k] = min(f[i-1][j][k], f[i - 1][j][id[i]] + f[i - 1][id[i]][k]);
		}
		rep(i,1,q)
		{
			cin >> u >> v >> w;
			int t = upper_bound(b + 1, b + 1 + n, w)-b;
			cout << f[t - 1][u][v]<<endl;
		}
	}
	// system("pause");
	return 0;
}