OJ Board

thx!! Jan ! i got AC .
that idea is too great .
it saves helf of the run time .

TLE -- because your program isn't fast enough. Generate an input with 100000 random numbers, and you'll see why.

You have to find a better algorithm, or use some clever data structure to speed up yours.
could you give me some idea about 481 ? THX!!
following is my code . i have the same problem ...

i tried above all , but i got WA , either.
following is my code :
#include<iostream>
using namespace std;
int main( int argc, char * argv[] )
{
int a,i,j,m,n,l[51][51],x,y,p[4]={1,1,-1,-1};
char k,d[4]={'N','E','S','W'},t[100];
cin >>m>>n;
for(i=0;i<=m;i++)
for(j=0;j<=n;j++)
l[i][j]=1;
while ...

long long array[30001];
int main{......}
just try it !!

[CORRECT!!]

(intput)
100 90
100 50
99 40
100 6
20 5
18 6
0 0

(output)
1591253560
445776180
445776180
1192052400
15504
18564


(THE TEST DATA WHICH SOMEBODY TOLD ME IS CORRECT) 8)[/quote]
I have a problem !
I used calculator to count c(100,90) and c(100,50).
I found that c(100,90) < c(100,50) , but ...

[CORRECT!!]

(intput)
100 90
100 50
99 40
100 6
20 5
18 6
0 0

(output)
1591253560
445776180
445776180
1192052400
15504
18564


(THE TEST DATA WHICH SOMEBODY TOLD ME IS CORRECT) 8)[/quote]
I have a problem !
I used calculator to count c(100,90) and c(100,50).
I found that c(100,90) < c(100,50) , but ...

thanx a lot !!

Please note that what is given in the input is the position of the i-th event in the chronological order, for example, in your input:

10
3 1 2 4 9 5 10 6 8 7
2 10 1 3 8 4 9 5 7 6

that means that in the correct order, event 1 is in the 3rd position, event 2 is in the first position..., like this ...

Mm......
not at all
because my english is not good
maybe i misunderstood your reply
sorry!!

sorry!!

Now i got AC !!

my program ran correctly in Borland C++ BuilderX 1.0 and got the right ans.

I doubt if acm can't use dynamic memory allocation.

or how to declare a 2570x1001 two-dimension array?