Problema tip Helly

Moderators: Laurian Filip, Filip Chindea, maky, Cosmin Pohoata

Post Reply
User avatar
Filip Chindea
Newton
Posts: 324
Joined: Thu Sep 27, 2007 9:01 pm
Location: Bucharest

Problema tip Helly

Post by Filip Chindea »

Consideram pe dreapta \( 2k - 1 \) intervale colorate cu negru si \( 2k - 1 \) cu rosu, astfel incat orice interval colorat in negru taie cel putin \( k \) rosii si orice interval rosu taie cel putin \( k \) colorate in negru. Sa se arate ca exista un interval negru ce taie toate intervalele rosii.

[ Teste tip OIM 2008 - Problema 1/Test 5 ]
Life is complex: it has real and imaginary components.
Top
Post Reply

Return to “Combinatorica”