INCVN - INCSEQ VN

Tác giả: flashmt

Ngôn ngữ: Pascal

const fi='';
      fo='';
      maxn=10001;
      z=5000000;
var n,k,i,x,re,j,t,maxc,max:longint;
    a,e,d:array[0..maxn] of longint;
    f:array[1..50,1..maxn] of longint;

procedure add(j,x,v:longint);
begin
     while x<=maxc do
     begin
          f[j,x]:=f[j,x]+v; 
          if f[j,x]>=z then f[j,x]:=f[j,x]-z;
          x:=x+x and (-x);
     end;
end;

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

procedure sort(l,r:longint);
var i,x,y,j:longint;
begin
     i:=l; j:=r; x:=a[(i+j) shr 1];
     repeat
           while a[i]<x do i:=i+1;
           while a[j]>x do j:=j-1;
           if i<=j then
           begin
                y:=a[i]; a[i]:=a[j]; a[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 sort(i,r);
     if l<j then sort(l,j);
end;

begin
     assign(input,fi); reset(input);
     assign(output,fo); rewrite(output);
     read(n,k); 
     if k=1 then
     begin
          writeln(n); halt;
     end;
     max:=-1;
     a[0]:=-1;
     for i:=1 to n do
     begin
          read(a[i]);
          d[i]:=i;
     end;
     close(input);
     sort(1,n);
     for i:=1 to n do
     begin
          e[d[i]]:=i;
          if a[i]=a[i-1] then d[i]:=d[i-1]
          else d[i]:=d[i-1]+1;
     end;
     maxc:=d[n];
     re:=0;
     for i:=1 to n do
     begin
          x:=d[e[i]];
          t:=calc(k-1,x-1);
          if t>0 then re:=(re+t) mod z;
          for j:=k-1 downto 2 do
          begin
               t:=calc(j-1,x-1);
               if t=0 then continue;
               add(j,x,t);
          end;
          add(1,x,1);
     end;
     writeln(re);
     close(output);
end.

Download