OJ Board

Hi,

I've just solved it. I was reading messages posted here and I aggree that problem should be better explained. I'm sure about that because it's an easy problem and there was too few accepted answers. I think it could be better exemplifieded.

My solution:

The input is '0.dddddd...', let L be ...

Hi, again,

I discovered... the problem permits 0 width builds... :|

[]'s
Gatis

Hi, all,

I've been trying to solve the 221 problem. I Think I can solve it use a simple algorithm, as follow:

[cpp]
visitBuild(b, xMin, xMax, height) {
if (xMin >= xMain) return;
if (b.front intersects [xMin; xMax]) && (b.height > heigth) {
b.visited = true;[/code]
//There are 3 cases ...