OJ Board

do u use dfs, bfs? or other algorithm? posting the code might help ^.^ hehheheh

it's funny 2 find out that ur program is completely perfect (even no problem with the -9999), the only reason why it's WA is ur using the wrong bracket. replace the bracket: "{}" with "()" and done...

next time, use glasses. u maybe need 1. =) hehhehe..

i'm a bit confused about printing the lexographical order of possible places.
consider this test case:

2
Y B A B 2
M B B A 5
A B

Would the output should be:
2 B A
-> B is printed first because the minimum energy is 2, or:

2 A B
-> print the minimum energy, afterwards all the possible places in ...

thx dude, that kinda explain things clearer 2 me.

but for the array MAXVALUE, should i create array sized [MAXDEPTH]
[-32000 to 32000] isn't is quite big stuf?

i know this 1 is a stupid question, but enlight me =P
"how to memorize the recursion result at level N into array and effectively prune when encountering repeated recursion"

somehow i'm still not sure bout the data representation for storing the result.... :roll: and effectively checking it if it's ...

How to 'EASILY' and 'EFFECTIVELY' determine in backtracking/dfs, if we had repeat the same pattern/configuration. Do we have to check it only at certain depth?? and how to store the repeated pattern??? and how can we make sure if we encounter this same pattern, e.g at level depth N, it would not ...

just find if exist a gcd(a,b) between the 2 numbers. convert it 2 decimal first. easy ain't it?