MCONVOI - Con Voi

Tác giả: flashmt

Ngôn ngữ: Pascal

uses math;
const fi='';
      maxn=300000;
      z=1000000007;
var n,maxc,re:longint;
    a,b,f,g,d:array[1..maxn] of longint;

procedure sort(l,r:longint);
var i,j,x,y,t:longint;
begin
     i:=l; j:=r; x:=a[(i+j) shr 1]; y:=b[(i+j) shr 1];
     repeat
           while (a[i]<x) or ((a[i]=x) and (b[i]>y)) do i:=i+1;
           while (a[j]>x) or ((a[j]=x) and (b[j]<y)) do j:=j-1;
           if i<=j then
           begin
                t:=a[i]; a[i]:=a[j]; a[j]:=t;
                t:=b[i]; b[i]:=b[j]; b[j]:=t;
                i:=i+1; j:=j-1;
           end;
     until i>j;
     if i<r then sort(i,r);
     if l<j then sort(l,j);
end;

procedure sortt(l,r:longint);
var i,j,x,y:longint;
begin
     i:=l; j:=r; x:=b[(i+j) shr 1];
     repeat
           while b[i]<x do i:=i+1;
           while b[j]>x do j:=j-1;
           if i<=j then
           begin
                y:=b[i]; b[i]:=b[j]; b[j]:=y;
                y:=d[i]; d[i]:=d[j]; d[j]:=y;
                i:=i+1; j:=j-1;
           end;
     until i>j;
     if i<r then sortt(i,r);
     if l<j then sortt(l,j);
end;

procedure edit;
var i:longint;
begin
     maxc:=1; a[d[1]]:=1;
     for i:=2 to n do
     begin
          if b[i]>b[maxc] then
          begin
               maxc:=maxc+1;
               b[maxc]:=b[i];
          end;
          a[d[i]]:=maxc;
     end;
end;

procedure rf;
var i:longint;
begin
     read(n);
     for i:=1 to n do
     begin
          read(a[i],b[i]);
          d[i]:=i;
     end;
     sort(1,n);
     sortt(1,n);
     edit;
end;

function calc(x:longint;var num:longint):longint;
var r:longint;
begin
     num:=0; r:=0;
     while x>0 do
     begin
          if f[x]=r then
          begin
               num:=num+g[x];
               if num>=z then num:=num-z;
          end;
          if f[x]>r then
          begin
               r:=f[x]; num:=g[x];
          end;
          x:=x-x and (-x);
     end;
     calc:=r;
end;

procedure add(x,val,num:longint);
begin
     while x<=maxc do
     begin
          if val<f[x] then exit;
          if val=f[x] then
          begin
               g[x]:=g[x]+num;
               if g[x]>=z then g[x]:=g[x]-z;
          end
          else
          begin
               f[x]:=val; g[x]:=num;
          end;
          x:=x+x and (-x);
     end;
end;

procedure pr;
var i,x,val,num:longint;
begin
     for i:=1 to n do
     begin
          x:=a[i];
          val:=calc(x-1,num);
          if num=0 then num:=1;
          add(x,val+1,num);
     end;
     val:=calc(maxc,num);
     writeln(val);
     writeln(num);
end;

begin
     assign(input,fi); reset(input);
     rf;
     pr;
     close(input);
end.

Download