LightOJ 1074 Extended Traffic(SPFA判负环）

https://vjudge.net/problem/LightOJ-1074

手动把和负环相连的点设置为答案为？，因为无限循环负环必然可以使得奖励为负数

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define mod 1000000007
#define inf 0x3f3f3f3f
using namespace std;
const int maxn = 205;
int n, m;
int head[maxn];
int a[maxn];
int d[maxn];
int num[maxn];
bool vis[maxn], visx[maxn];
int cnt;
struct node
{
    int to, next, w;
}e[maxn*maxn];
void addedge(int u, int v, int w)
{
    e[cnt].to = v;
    e[cnt].w = w;
    e[cnt].next = head[u];
    head[u] = cnt ++;
}
void init()
{
    cnt = 0;
    memset(visx, 0, sizeof(visx));
    memset(vis, 0, sizeof(vis));
    memset(head, -1, sizeof(head));
    memset(d, 0x3f, sizeof(d));
    memset(num, 0, sizeof(num));
}
void dfs(int u)
{
    visx[u] = 1;
    for(int i = head[u]; ~i; i = e[i].next)
        if(! visx[e[i].to])
            dfs(e[i].to);
}
void spfa()
{
    queue<int> q;
    vis[1] = 1;
    q.push(1);
    d[1] = 0;
    num[1] = 1;
    while(! q.empty())
    {
        int h = q.front();
        q.pop();
        vis[h] = 0;
        for(int i = head[h]; ~i; i = e[i].next)
        {
            int v = e[i].to;
            if(visx[v]) continue;
            if(d[v] > d[h] + e[i].w)
            {
                d[v] = d[h] + e[i].w;
                if(! vis[v])
                {
                    vis[v] = 1;
                    q.push(v);
                    num[v] ++;
                    if(num[v] > n)
                        dfs(v);
                }
            }
        }
    }
}
int main()
{
    int t;
    scanf("%d", &t);
    int cas = 0;
    while(t --)
    {
        init();
        scanf("%d", &n);
        for(int i = 1; i <= n; i ++)
            scanf("%d", &a[i]);
        scanf("%d", &m);
        int u, v;
        for(int i = 1; i <= m; i ++)
        {
            scanf("%d%d", &u, &v);
            addedge(u, v, (a[v]-a[u])*(a[v]-a[u])*(a[v]-a[u]));
        }
        spfa();
        int q;
        scanf("%d", &q);
        int tmp;
        printf("Case %d:\n", ++ cas);
        while(q --)
        {
            scanf("%d", &tmp);
            if(visx[tmp] || d[tmp] == inf || d[tmp] < 3)
                printf("?\n");
            else
                printf("%d\n", d[tmp]);
        }
    }
    return 0;
}