Timeline for I have n boys and n girls. I need to pair as much of them as possible for a dance in O(nlogn). Reduce this to a standard problem?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 10, 2017 at 12:16 | vote | accept | Edza | ||
| Nov 10, 2017 at 12:16 | comment | added | Edza | Thanks for the general idea. Looks correct. Accepted as answer. | |
| Nov 9, 2017 at 15:59 | comment | added | Edza | What do you mean by "If instead you match her with boy #k or with nobody,". How could you swap with "nobody" without breaking everything? | |
| Nov 9, 2017 at 14:53 | comment | added | Edza | You got A and B wrong. Both in the inequality and the single B should be A. Otherwise I will accept this as the correct answer. Thanks :) | |
| Nov 6, 2017 at 22:44 | history | answered | gnasher729 | CC BY-SA 3.0 |