解题思路:
先读入数据,用一个数组以颜色为下标,再用记录类型开数组储存每种颜色的客栈,然后用多重循环,如果有符合条件的就加上它后面所有同颜色的客栈数量,最后输出答案即可。
程序:
const
maxn=200000;
type
color=record
seat:array[1..maxn]of longint;
sum:longint;
end;
var
a:array[1..maxn]of longint;
b:array[0..50]of color;
n,k,p,i,j,l,ans:longint;
procedure init;
var
i,x,y:longint;
begin
readln(n,k,p);
for i:=1 to n do
begin
readln(x,y);
inc(b[x].sum);
b[x].seat[b[x].sum]:=i;
a[i]:=y;
end;
end;
procedure main;
var
i,j,l,l1,x:longint;
f:boolean;
begin
init;
for i:=0 to k do
for j:=1 to b[i].sum-1 do
for l:=b[i].seat[j] to b[i].seat[b[i].sum] do
if (a[l]<=p) then
begin
for l1:=j to b[i].sum do
if (b[i].seat[l1]>=l) then
begin
x:=l1-1;
if (l1=1)or(l1=j) then inc(x);ans:=ans+b[i].sum-x;
break;
end;
break;
end;
writeln(ans);
end;
begin
main;
end.
版权属于: Chris
转载时必须以链接形式注明原始出处及本声明。