2016 NOIP第三题 海港

题目：

代码：

const maxn=300000;
var x,time,k,ans,i,j,ii,n,head,tail:longint;
hash:array[1..maxn]of longint;
man:array[1..2,1..maxn]of longint;
begin
readln(n);
head:=1; tail:=1;
for i:=1 to n do
begin
read(time,k);
for j:=tail to tail+k-1 do
begin
read(x);
man[1,j]:=time;
man[2,j]:=x;
inc(hash[x]);
if hash[x]-1=0 then inc(ans);
end;
readln;
while time-man[1,head]>=86400 do
begin
dec(hash[man[2,head]]);
if hash[man[2,head]]=0 then dec(ans);
inc(head);
end;
tail:=tail+k;
writeln(ans);
end;
end.