zoukankan      html  css  js  c++  java
  • poj_3159_Candies

    Description

    During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute them. All the kids loved candies very much and often compared the numbers of candies they got with others. A kid A could had the idea that though it might be the case that another kid B was better than him in some aspect and therefore had a reason for deserving more candies than he did, he should never get a certain number of candies fewer than B did no matter how many candies he actually got, otherwise he would feel dissatisfied and go to the head-teacher to complain about flymouse’s biased distribution.

    snoopy shared class with flymouse at that time. flymouse always compared the number of his candies with that of snoopy’s. He wanted to make the difference between the numbers as large as possible while keeping every kid satisfied. Now he had just got another bag of candies from the head-teacher, what was the largest difference he could make out of it?

    Input

    The input contains a single test cases. The test cases starts with a line with two integers N and M not exceeding 30 000 and 150 000 respectively. N is the number of kids in the class and the kids were numbered 1 through N. snoopy and flymouse were always numbered 1 and N. Then follow M lines each holding three integers A, B and c in order, meaning that kid A believed that kid B should never get over c candies more than he did.

    Output

    Output one line with only the largest difference desired. The difference is guaranteed to be finite.

    题解

    裸的差分约束系统啊!!
    但是,但是,但是要用栈优化。

    代码

    const
      maxE=150001;
      maxV=30001;
    type
      arr=record
            y,w,next:longint;
          end;
    var
      n,m,nm:longint;
      d,ls,st:array [0..maxV] of longint;
      v:array [0..maxV] of boolean;
      a:array [0..maxE] of arr;
    procedure add(u,v,z:longint);
    begin
      inc(nm);
      with a[nm] do
        begin
          y:=v; w:=z;
          next:=ls[u];
          ls[u]:=nm;
        end;
    end;
    
    procedure init;
    var
      i,u,v,z:longint;
    begin
      readln(n,m); nm:=0;
      for i:=1 to m do
        begin
          readln(u,v,z);
          add(u,v,z);
        end;
    end;
    
    procedure spfa;
    var
      i,t,x:longint;
    begin
      fillchar(d,sizeof(d),63);
      t:=1;
      d[1]:=0; st[1]:=1; v[1]:=true;
      while t<>0 do
        begin
          x:=st[t]; dec(t);
          i:=ls[x];
          while i<>0 do
            begin
              if d[a[i].y]>d[x]+a[i].w then
                begin
                  d[a[i].y]:=d[x]+a[i].w;
                  if not v[a[i].y] then
                    begin
                      v[a[i].y]:=true;
                      inc(t);
                      st[t]:=a[i].y;
                    end;
                end;
              i:=a[i].next;
            end;
          v[x]:=false;
        end;
    end;
    
    begin
      init;
      spfa;
      write(d[n]);
    end.
  • 相关阅读:
    ElementUI中弹窗使用textarea原样显示SpringBoot后台带换行的StringBuilder内容
    Node搭建静态资源服务器时后缀名与响应头映射关系的Json文件
    Nodejs中搭建一个静态Web服务器,通过读取文件获取响应类型
    JS中怎样比较两个时分格式的时间大小
    ElementUI中对el-table的某一列的时间进行格式化
    MongoDb在Windows上的下载安装以及可视化工具的下载与使用
    Express中使用ejs新建项目以及ejs中实现传参、局部视图include、循环列表数据的使用
    FFmpeg-20160506-snapshot-bin
    FFmpeg-20160428-snapshot-bin
    FFmpeg-20160422-snapshot-bin
  • 原文地址:https://www.cnblogs.com/zyx-crying/p/9319539.html
Copyright © 2011-2022 走看看