看了kuangbin大神的,,
原来可以这样实现堆栈,而且还更快,快了 1s , 、
而且原来差分约束的这个意思。。就是对于不等式组用最短路
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<string>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<stack>
#include<cmath>
#include<map>
#include<vector>
#define ll long long
#define inf 0x3f3f3f3f
#define INF 1e9
#define bug1 cout<<"bug1"<<endl;
#define bug2 cout<<"bug2"<<endl;
#define bug3 cout<<"bug3"<<endl;
using namespace std;
#define sf scanf
#define pf printf
#define mem(a,b) memset(a,b,sizeof(a));
int n,m;
const int maxn=30005;
const int maxm=150005;
int tol;
int head[maxn];
int vis[maxn];
int d[maxn];
struct Edge{
int v,nxt,c;
}edge[maxm*2];
void addedge(int u,int v,int c){
edge[tol].v=v;edge[tol].c=c;
edge[tol].nxt=head[u];
head[u]=tol++;
}
int st[maxn];
void spfa(){
int top=0;
mem(st,0);
mem(d,inf);
mem(vis,0);
st[top++]=1;
d[1]=0;
vis[1]=1;
while(top!=0){
int u=st[--top];
vis[u]=0;
for(int i=head[u];~i;i=edge[i].nxt){
int v=edge[i].v;
if(d[v]>d[u]+edge[i].c){
d[v]=d[u]+edge[i].c;
if(!vis[v]){
vis[v]=1;st[top++]=v;
}
}
}
}
}
int main(){
while(~scanf("%d%d",&n,&m)){
tol=0;
mem(head,-1);
int ans1=0;
for(int i=1;i<=m;++i){
int u,v,c;
sf("%d%d%d",&u,&v,&c);
if(u==n&&v==1)ans1=c;
addedge(u,v,c);
}//大-小<=c ,有向边(小,大):c
spfa();
pf("%d\n",d[n]);
}
}