PKU1201 intervals

       这是一道差分约束的图论题目，涉及到SPFA算法。

       首先，来了解一下所谓差分约束系统。如果我们有一系列的Ax<=b的约束条件，我们就可以通过建立约束图，寻找最短路或最长路得方法来求解这类问题。对于一个约束条件x[j]-x[i]<=k，那么我们就需要连接一条从i到j权值为k的边。我们一旦得出了一条最短路径就是一个可行解，出现了负权回路就是没有可行解。如果我们有一个可行解，那么在这组可行解的每个数据上加上相同的数，也是一个可行解。

       这样，对于这道题，我们有如下约束条件：

s[b]-s[a-1]>=c

1>=s[i]-s[i-1]>=0

       构图求解即可！

program intervals; const arrn=50010; inf=2000000; type rec=record left,right,count:longint; end; link=record u,v,w:longint; end; var data:array[0..arrn] of rec; edge:array[0..arrn shl 2] of link; vis:array[0..arrn] of boolean; star,dist,que:array[0..arrn] of longint; n,tot,max:longint; procedure init; var i:longint; begin readln(n); max:=-1; for i:=1 to n do with data[i] do begin readln(left,right,count); if right>max then max:=right; end; end; procedure prework; begin tot:=0; filldword(dist,sizeof(dist) shr 2,inf); end; procedure makegraph; var i:longint; begin for i:=1 to n do with data[i] do begin inc(tot); with edge[tot] do begin u:=right; v:=left-1; w:=-count; end; end; for i:=1 to max do begin inc(tot); with edge[tot] do begin u:=i; v:=i-1; w:=0; end; inc(tot); with edge[tot] do begin u:=i-1; v:=i; w:=1; end; end; end; procedure swap(var a,b:link); var t:link; begin t:=a; a:=b; b:=t; end; procedure qsort(s,t:longint); var l,r,key:longint; 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 swap(edge[l],edge[r]); inc(l); dec(r); end; end; if s<r then qsort(s,r); if l<t then qsort(l,t); end; procedure makestar; var i:longint; begin star[max+1]:=tot+1; for i:=tot downto 1 do with edge[i] do star[u]:=i; end; procedure spfa(s:longint); var head,tail,x,i:longint; begin fillchar(vis,sizeof(vis),0); vis[s]:=true; dist[s]:=0; que[1]:=s; head:=0; tail:=1; while head<>tail do begin inc(head); head:=head mod (max+1); x:=que[head]; vis[x]:=false; for i:=star[x] to star[x+1]-1 do with edge[i] do if dist[v]>dist[u]+w then begin dist[v]:=dist[u]+w; if not vis[v] then begin inc(tail); tail:=tail mod (max+1); que[tail]:=v; vis[v]:=true; end; end; end; end; procedure outit; begin writeln(-dist[0]); end; begin assign(input,'a.in'); reset(input); assign(output,'a.out'); rewrite(output); init; prework; makegraph; qsort(1,tot); makestar; spfa(max); outit; close(input); close(output); end.