fork download 
  1. program sushi;
  2. Uses Math;
  3. const MAXN=100002;
  4. type piatto = record
  5.                    inizio:int64;
  6.                    durata:int64;
  7.                    peso:int64;
  8.                    fine:int64;
  9.                 end;
  10.      elenco = array[0.. MAXN-1] of int64;           
  11.      table = array[0..MAXN-1] of piatto;          
  12. var N,i,id:Longint;
  13.     ricordafine : int64;
  14.     T : table; 
  15.     S,W,D,E, DP, ricordaindice, ricordaindice2:elenco;  (*array riferiti ai piatti Start, Weigth, Durata, End*)
  16.     uscita : boolean;
  17.  
  18. Procedure scambia (var a,b: int64);
  19. var x:int64;
  20. begin
  21.    x:=a;
  22.    a:=b;
  23.    b:=x;
  24. end;  
  25.  
  26. Procedure ordinamento (estremoi,estremos: int64; var v : elenco; var u:elenco; ordinato:boolean);
  27. var inf, sup, medio:int64;
  28.     pivot :int64;
  29. begin
  30.     inf:=estremoi;
  31.     sup:=estremos;
  32.     medio:= (estremoi+estremos) div 2;
  33.     pivot:=v[medio];
  34.     repeat
  35.       if (ordinato) then
  36.          begin
  37.             while (v[inf]<pivot) do  inf:=inf+1;
  38.             while (v[sup]>pivot) do  sup:=sup-1;
  39.          end;
  40.       if inf<=sup then
  41.        begin
  42.          scambia(v[inf],v[sup]);
  43.          scambia(u[inf],u[sup]);
  44.          inf:=inf+1;
  45.          sup:=sup-1;
  46.        end;
  47.     until inf>sup;
  48.     if (estremoi<sup) then ordinamento(estremoi,sup,v,u,ordinato);
  49.     if (inf<estremos) then ordinamento(inf,estremos,v,u,ordinato);
  50. end;
  51. Procedure ricercaLower (var w:elenco; target:int64); 
  52.   var m,start,eend: int64;
  53.  
  54.  begin  
  55.    start:=0; eend:=N-1 ; m:=-1;
  56.    while start<=eend do
  57.            begin
  58.                   m:=(start + eend) div 2;
  59.                   if w[m]<=target then begin id:=m;  start:=m+1 end
  60.                                   else  if w[m]>target then   eend:=m-1; 
  61.            end;
  62.    if eend=-1 then id:=-1;
  63.  end;
  64.  
  65. begin
  66.    (*assign(input,  'input.txt');  reset(input);
  67.    assign(output, 'output.txt'); rewrite(output);*)
  68.    readln(N);
  69.    for i:=0 to N-1 do begin ricordaindice[i]:=i;  DP[i]:=0; end;
  70.    for i:=0 to N-1 do
  71.       begin
  72.         { dish on table }
  73.          readln(S[i],W[i],D[i]);
  74.          E[i]:=S[i]+D[i];
  75.          T[i].inizio:=S[i];
  76.          T[i].durata:=D[i];
  77.          T[i].peso:=W[i];
  78.          T[i].fine:=E[i];
  79.       end;
  80.     ordinamento(0,N-1,E, ricordaindice,true);
  81.     for i:=0 to N-1 do
  82.                 begin
  83.                     ricordafine:=T[ricordaindice[i]].inizio;
  84.                     ricercaLower(E, ricordafine);
  85.                     if id<>-1 then
  86.                                 DP[i]:=max (DP[i-1],DP[id]+T[ricordaindice[i]].peso)
  87.                               else 
  88.                                 begin 
  89.                                   if i=0 then DP[i]:=T[ricordaindice[i]].peso
  90.                                          else DP[i]:=max (DP[i-1],T[ricordaindice[i]].peso)
  91.                                 end;         
  92.                 end;
  93.    writeln(DP[N-1]);   
  94. end.
  95.  
Success #stdin #stdout 0.01s 6612KB
comments (?)
stdin 
4
6 24 3
8 16 5
17 4 1
11 11 2
stdout 
39
https://ideone.com/TSyE0T
language:
Pascal (fpc 3.0.4)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!