Why not 3 260 ?
position i=21;j=52
Understood!
I solved the problem in much more difficult
consideration when elementary operations may applied
to shelves many times to each!

AC finally! I think that it is very difficult problem
on DP discret optimization.

Finally some test with answers of my AC prog:
3 3 1 3
4
2 0 1 0 1
1 1 1 0 1
2 2 1 0 1
0 1 2 0 2

 res: 1 0

6 4 3 3
7
0 0 1 0 1
0 3 3 0 3
1 3 1 0 3
2 2 1 0 1
2 4 1 0 1
4 2 1 0 1
4 4 1 0 1
res 3 0

11 3 2 2
4
1 0 3 0 3
2 1 2 0 2
2 4 4 0 4
2 7 3 1 2

res: 1 1

6 3 1 3
4
0 0 1 0 1
2 0 1 0 1
2 2 4 1 3
1 1 1 0 1

res: 2 0

Edited by author 18.11.2007 12:30