Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

ft，这么简单，怪不得程序暴短

Posted by frkstyc at 2005-05-10 14:59:52 on Problem 2182
In Reply To:我似乎就是线形查找的构造.......而且似乎我这样都没法用线段树.....里面有程序~ Posted by:palmtenor at 2005-05-10 14:58:30

> const
>       maxn=8000;
> var
>       seq:array[1..maxn] of longint;
>       i,j,k,l,m,n,t,s:longint;
> begin
>  while not eof(input) do begin
>  readln(n);
>  fillchar(seq,sizeof(seq),0);
>  seq[1]:=1;
>  for i:=2 to n do begin
>   readln(seq[i]);
>   inc(seq[i]);
>   for j:=1 to i-1 do if seq[j]>=seq[i] then inc(seq[j]);
>  end;
>  for i:=1 to n do writeln(seq[i]);
> end;
> end.

Followed by:

我的和这个类似。233MS。 (0) ciciatc 2005-05-10 15:30:05
- 和gcc编译的bst时间一样 (0) frkstyc 2005-05-10 15:32:12

Post your reply here:

Home Page Go Back To top