P1868 饥饿的奶牛

题目描述

有N个区间，选择任意区间但不能重复，输出最长区间。

样例输入

3
1 3
7 8
3 4

样例输出

5

思路

O(n^2)
先以每个区间开始排序，方程：
f[i]:=max(f[i],f[x[j]-1]+y[j]-x[j]+1);

var
  f,x,y:array[0..4000000]of longint;
procedure sort(l,r:longint);
var
  i,j,mid,s:longint;
begin
  i:=l;j:=r;
  mid:=y[(l+r)div 2];
  repeat
    while y[i]<mid do inc(i);
    while y[j]>mid do dec(j);
    if i<=j then
      begin
        s:=y[i];y[i]:=y[j];y[j]:=s;
        s:=x[i];x[i]:=x[j];x[j]:=s;
        inc(i);dec(j);
      end;
  until i>j;
  if i<r then sort(i,r);
  if l<j then sort(l,j);
end;
function max(a,b:longint):longint;
begin
  if a>b then exit(a)
    else exit(b);
end;
var
  i,j,n,k:longint;
begin
  readln(n);
  for i:=1 to n do
    readln(x[i],y[i]);
  sort(1,n);j:=1;
  for i:=1 to y[n] do
    begin
      f[i]:=f[i-1];
      for k:=j to n do
        if i=y[k] then
          begin
            f[i]:=max(f[i],f[x[j]-1]+y[j]-x[j]+1);
            inc(j);
          end
        else break;
    end;
  writeln(f[y[n]]);
end.