OJ Board

I get all the test cases correct, but still get WA.
Any other special cases that may exist?

The name of your algo said it all. I guess you go in a recursion to deep for the Online Judge call stack.

BTW, you should use BBCode formating when sending source code to the forum, it's much more readable.

Also, we don't have to know your Judge ID

As far as i know, LongInt type is Borland Pascal specific, ant it's a signed 32 bit integer.
There is a Cardinal type in Borland's Object Pascal that is a unsigned 32 bit integer, but i'm not sure if it is supported by the Online Judge

I'm using a string to read in the characters.
Using my compiler (Delphi 5) i can get it right using 1000000 characters,
but i keep getting WA from the judge.

Are Pascal strings limited to 255B (1 byte string lenght) or 2GB (2 byte string lenght - ANSI String)?

Here's my Program
[pascal]
program ...

I'm trying to solve 10324, using a string to read in the characters.
Using my compiler (Delphi 5) i can get it right using 1000000 characters,
but i keep getting WA from the judge.

Are Pascal strings limited to 255B (1 byte string lenght) or 2GB (2 byte string lenght - ANSI String)?

[pascal ...

read the problem description carefully:

In this approach only one operation ( Flip ) is available and that is you can exchange two adjacent terms.

Tip: try your first version, minus the swaping of the list elements.

--
SWeko has spoken

I constantly got TL despite any "optimisations" i made, until i just made a table[1..5000], and it worked on the first try