RQNOJ520 trade

         NOIP2009第三题也。

         这道题我觉得可以用消圈加拓扑排序吧？尽管我没有尝试……我发现这种两次SPFA是很好的思路。对于这种标号修改型的数据来说基本都可以用SPFA来解决，代码也很短小。

         总体思路在下面的代码中很清晰——更新从1开始的路径上的购买时的最小值，再更新以n结束的路径上的卖出时的最大值，它们的差值的最大值就是我们的答案！

 

program trade; type rec=record u,v:longint; end; const maxnum=100005; var edge:array[0..maxnum*10] of rec; cost,min,max,f,que:array[0..maxnum] of longint; vis:array[0..maxnum] of boolean; n,m,ans,s,x,head,tail:longint; procedure prework; begin ans:=0; m:=0; randomize; fillchar(max,sizeof(max),0); filldword(min,sizeof(min) shr 2,maxlongint); end; procedure link(x,y:longint); begin with edge[m] do begin u:=x; v:=y; end; end; procedure init; var i,r,x,y,z:longint; begin readln(n,r); for i:=1 to n do read(cost[i]); for i:=1 to r do begin readln(x,y,z); inc(m); link(x,y); if z=2 then begin inc(m); link(y,x); end; end; end; procedure qsort(s,t:longint); var l,r,key:longint; tt:rec; begin l:=s; r:=t; key:=edge[random(t-s+1)+s].u; while l<=r do begin while edge[l].u<key do inc(l); while edge[r].u>key do dec(r); if l<=r then begin tt:=edge[l]; edge[l]:=edge[r]; edge[r]:=tt; inc(l); dec(r); end; end; if s<r then qsort(s,r); if l<t then qsort(l,t); end; procedure findstar; var i:longint; begin for i:=m downto 1 do f[edge[i].u]:=i; f[n+1]:=m+1; for i:=n downto 1 do if f[i]=0 then f[i]:=f[i+1]; end; procedure turndirect; var i,t:longint; begin for i:=1 to m do with edge[i] do begin t:=u; u:=v; v:=t; end; end; function getmin(a,b:longint):longint; begin if a<b then exit(a) else exit(b); end; function getmax(a,b:longint):longint; begin if a>b then exit(a) else exit(b); end; procedure spfapre; begin fillchar(vis,sizeof(vis),0); vis[s]:=true; head:=1; tail:=1; que[1]:=s; end; procedure popvex; begin x:=que[head]; vis[x]:=false; inc(head); if head=maxnum then head:=0; end; procedure pushvex(x:longint); begin inc(tail); que[tail]:=x; vis[x]:=true; if tail=maxnum then tail:=0; end; procedure spfamin; var i,tmp:longint; begin s:=1; min[s]:=cost[s]; spfapre; while head<=tail do begin popvex; for i:=f[x] to f[x+1]-1 do with edge[i] do begin tmp:=getmin(min[x],cost[v]); if tmp<min[v] then begin min[v]:=tmp; if not vis[v] then pushvex(v); end; end; end; end; procedure spfamax; var i,tmp:longint; begin s:=n; max[s]:=cost[s]; spfapre; while head<=tail do begin popvex; for i:=f[x] to f[x+1]-1 do with edge[i] do begin tmp:=getmax(max[x],cost[v]); if tmp>max[v] then begin max[v]:=tmp; if not vis[v] then pushvex(v); end; end; end; end; procedure outit; var i:longint; begin for i:=1 to n do if max[i]-min[i]>ans then ans:=max[i]-min[i]; writeln(ans); end; begin assign(input,'trade.in'); reset(input); assign(output,'trade.out'); rewrite(output); prework; init; qsort(1,m); findstar; spfamin; turndirect; qsort(1,m); findstar; spfamax; outit; close(input); close(output); end.