3636 nested dolls{dilworth}
2013-11-04 21:43
218 查看
var
t,k,i,j,n:longint;
l,w:array[1..20000] of longint;
procedure swap(var a,b:longint);
var
t:longint;
begin
t:=a;a:=b;b:=t;
end;
procedure qsort(le,ri:longint);
var
i,j,ml,mw:longint;
begin
i:=le;
j:=ri;
ml:=l[(le+ri) shr 1];
mw:=w[(le+ri) shr 1];
repeat
while (l[i]
while (l[j]>ml) or
((l[j]=ml) and (w[j]>mw)) do dec(j);
if i<=j then
begin
swap(l[i],l[j]);
swap(w[i],w[j]);
inc(i);
dec(j);
end;
until i>j;
if j>le then qsort(le,j);
if i
end;
function gettime:longint;
var
f:array[1..20000] of longint;
i,j:longint;
begin
qsort(1,n);
for i:=1 to n do
f[i]:=1;
for i:=2 to n do
for j:=i-1 downto 1
do
begin
if (w[j]>w[i]) and (f[j]+1>f[i])
then
f[i]:=f[j]+1;{超时,求优化。。}
end;
gettime:=0;
for i:=1 to n do
if gettime
end;
begin
read(t);
for k:=1 to t do
begin
fillchar(l,sizeof(l),0);
fillchar(w,sizeof(w),0);
read(n);
for
i:=1 to n do
read(l[i],w[i]);
writeln(gettime);
end;
end.
t,k,i,j,n:longint;
l,w:array[1..20000] of longint;
procedure swap(var a,b:longint);
var
t:longint;
begin
t:=a;a:=b;b:=t;
end;
procedure qsort(le,ri:longint);
var
i,j,ml,mw:longint;
begin
i:=le;
j:=ri;
ml:=l[(le+ri) shr 1];
mw:=w[(le+ri) shr 1];
repeat
while (l[i]
while (l[j]>ml) or
((l[j]=ml) and (w[j]>mw)) do dec(j);
if i<=j then
begin
swap(l[i],l[j]);
swap(w[i],w[j]);
inc(i);
dec(j);
end;
until i>j;
if j>le then qsort(le,j);
if i
end;
function gettime:longint;
var
f:array[1..20000] of longint;
i,j:longint;
begin
qsort(1,n);
for i:=1 to n do
f[i]:=1;
for i:=2 to n do
for j:=i-1 downto 1
do
begin
if (w[j]>w[i]) and (f[j]+1>f[i])
then
f[i]:=f[j]+1;{超时,求优化。。}
end;
gettime:=0;
for i:=1 to n do
if gettime
end;
begin
read(t);
for k:=1 to t do
begin
fillchar(l,sizeof(l),0);
fillchar(w,sizeof(w),0);
read(n);
for
i:=1 to n do
read(l[i],w[i]);
writeln(gettime);
end;
end.
相关文章推荐
- HDU 4160 (ZZULI 1598) Dolls(二分…
- UVA 11368 & POJ 3636 & HDU 1677 Nested Dolls(贪心 + 二分LIS)
- ORACLE 连接方式 NESTED LOOP、HAS…
- 【POJ3636】Nested Dolls Dilworth定理(偏序集定理二)
- oracle&nbsp;nested&nbsp;table
- Static Nested Class&nb…
- HDU:1165 Eddy's research II
- s3c2440&nbsp;spi驱动DMA模式
- 杭电1178--Heritage from father
- ACM: 一题二分搜索题 poj3273 (…
- POJ 2039 To and Fro
- V4L2&nbsp;usb&nbsp;摄像头&nbsp;测试
- C# 委托应用总结
- ACM: 高速打素数表 TOJ 3749 (疯狂…
- ZZULI_SummerPractice(3) POJ 12…
- V4L2&nbsp;-&nbsp;Linux下视频驱动模型
- 我的windows mobile WCF项目
- 【转】OGRE&nbsp;模型绘制
- ACM: 模拟题 poj 2632 (开始做模拟…
- Error: The system&nbsp…