[SDOI2009]Elaxia的路线

先以x1 x2 y1 y2为起点跑4遍SPFA

然后判定各条边在不在最短路上=如果两条最短路上都有则加入新图（有向边）

对新图跑拓扑求最长链

萌萌哒cd：可以无向边啊（TMD还A了我天老爷）

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define rep(j,k,l) for (int j=k;j<=l;++j)
#define red(j,k,l) for (int j=k;j>=l;--j)
#define N 1505
#define M 1000005

using namespace std;
int to[M],ne[M],sm[M],st[N],sum[N][4],aa[N],que[N],a[M],b[M],c[M];
int n,m,x1,y1,x2,y2,cnt,Mx,su[N],used[N];

void add(int k,int l,int poi){
    
    to[++cnt]=l;
    ne[cnt]=st[k];
    st[k]=cnt;
    sm[cnt]=poi;
    
}

void Add(int k,int l,int poi){
    
    to[++cnt]=l;
    ne[cnt]=st[k];
    st[k]=cnt;
    sm[cnt]=poi;
    aa[l]++;
    
}

void SPFA(int k,int poi){
    
    rep(i,1,n) sum[i][poi]=-1,used[i]=0;
    sum[k][poi]=0;que[1]=k;used[k]=1;
    int head=0,tail=1;
    while (head!=tail){
        
        head=(head+1)%N;
        int x=que[head];
        used[x]=0;
        for (int i=st[x];i;i=ne[i])
            if (sum[to[i]][poi]==-1||sum[to[i]][poi]>sum[x][poi]+sm[i]){
                
                sum[to[i]][poi]=sum[x][poi]+sm[i];
                if (used[to[i]]==0){
                    
                    used[to[i]]=1;
                    tail=(tail+1)%N;
                    que[tail]=to[i];
                    
                }
                
            }
        
    }
    
}

int main(){
    
    scanf("%d%d",&n,&m);
    scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
    rep(i,1,m) scanf("%d%d%d",a+i,b+i,c+i);
    rep(i,1,m) add(a[i],b[i],c[i]),add(b[i],a[i],c[i]);
    SPFA(x1,0);SPFA(y1,1);SPFA(x2,2);SPFA(y2,3);
    //printf("%d %d\n",sum[y1][0],sum[y2][2]);
    memset(st,0,sizeof(st));
    cnt=0;
    rep(i,1,m){
        
        if (sum[a[i]][0]+c[i]+sum[b[i]][1]==sum[y1][0]&&(sum[a[i]][2]+c[i]+sum[b[i]][3]==sum[y2][2]||sum[b[i]][2]+c[i]+sum[a[i]][3]==sum[y2][2]))
            Add(a[i],b[i],c[i]);
        if (sum[b[i]][0]+c[i]+sum[a[i]][1]==sum[y1][0]&&(sum[a[i]][2]+c[i]+sum[b[i]][3]==sum[y2][2]||sum[b[i]][2]+c[i]+sum[a[i]][3]==sum[y2][2]))
            Add(b[i],a[i],c[i]);
        
    }
    int head=0,tail=0;
    rep(i,1,n) su[i]=-1;
    rep(i,1,n) if (aa[i]==0) su[i]=0,que[++tail]=i;
    while (head!=tail){
        
        int x=que[++head];
        for (int i=st[x];i;i=ne[i]){
            
            su[to[i]]=max(su[to[i]],su[x]+sm[i]);
            Mx=max(Mx,su[to[i]]);
            aa[to[i]]--;
            if (aa[to[i]]==0) que[++tail]=to[i];
            
        }
        
    }
    printf("%d\n",Mx);
    system("pause");
    
}