if i declare

type StackR=array[1..100000] of ^longint;
type Stack=^StackR;
var m:array[1..1000] of Stack;

does this mean that my program has used 100000x1000x4 = 4x10^9bytes? together with the fact that my variables are dynamic and I call the new() procedure not more than for 100000 longints?

> not more than for 100000 longints?

plus not more than 100000 pointers (4 byte)

total: 800K of data => MLE

thx, but then how do i make it? the actual part of the problem is nothing hard...

Use another data presentation and O(n*n) algorithm instead of O(n).

The actual part of this problem is to do it in 750K