bzoj1563

 1 type node=record
 2        l,r,x:longint;
 3      end;
 4 
 5 var q:array[0..100010] of node;
 6     f:array[0..100010] of extended;
 7     s:array[0..100010] of longint;
 8     x,h,r,i,n,l,p,tt:longint;
 9     ss:string;
10 
11 function pow(x:extended):extended;
12   var i:longint;
13   begin
14     pow:=1;
15     for i:=1 to p do
16       pow:=pow*x;
17   end;
18 
19 function calc(j,i:longint):extended;
20   begin
21     exit(f[j]+pow(abs(s[i]-s[j]+i-j-1-l)));
22   end;
23 
24 function max(a,b:longint):longint;
25   begin
26     if a>b then exit(a) else exit(b);
27   end;
28 
29 function min(a,b:longint):longint;
30   begin
31     if a>b then exit(b) else exit(a);
32   end;
33 
34 procedure update(i:longint);
35   var l,t,m,ans:longint;
36   begin
37     if calc(i,n)>calc(q[r].x,n) then exit;
38     while (i<q[r].l) and (calc(i,q[r].l)<calc(q[r].x,q[r].l)) do dec(r);
39 
40     l:=max(i+1,q[r].l);
41     t:=q[r].r;
42     ans:=min(n,q[r].r+1);
43     while l<=t do
44     begin
45       m:=(l+t) shr 1;
46       if calc(i,m)<calc(q[r].x,m) then
47       begin
48         ans:=m;
49         t:=m-1;
50       end
51       else l:=m+1;
52     end;
53     q[r].r:=ans-1;
54     inc(r);
55     q[r].x:=i;
56     q[r].l:=ans;
57     q[r].r:=n;
58   end;
59 
60 begin
61   readln(tt);
62   while tt>0 do
63   begin
64     dec(tt);
65     readln(n,l,p);
66     s[0]:=0;
67     for i:=1 to n do
68     begin
69       readln(ss);
70       x:=length(ss);
71       s[i]:=s[i-1]+x;
72     end;
73     h:=1;
74     r:=1;
75     q[1].x:=0;
76     q[1].l:=1;
77     q[1].r:=n;
78     for i:=1 to n do
79     begin
80       while i>q[h].r do inc(h);
81       f[i]:=calc(q[h].x,i);
82       update(i);
83     end;
84     if f[i]<=1e18 then writeln(trunc(f[i])) //注意这里trunc不能0:0
85     else writeln(‘Too hard to arrange‘);
86     writeln(‘--------------------‘);
87   end;
88 end.