Topic

Z-dijamant

Dgleich2009-07-01 08:45:16

Can this task be solved with Bruteforce by checking every '#' as middle and trying to go up and down?
or this task can be solved using Dp?

Al3kSaNdaR2009-07-01 08:46:03

Using DP. :)

Al3kSaNdaR2009-07-01 08:46:30

Very similar to task bogatas.

Dgleich2009-07-01 08:48:43

Too bad I didn't solved bogatas with dp I solved it with Bf and making Rectangles of sums similar to Bit but without Log ( n ) set , only with o ( 1 ) query...

Dgleich2009-07-01 09:05:19

Solved thanks for hint :)

Al3kSaNdaR2009-07-01 09:11:14

Np. ;)