Professional Documents
Culture Documents
Competitive Programming
Competitive Programming
Competitive Programming
1
Greedy wont work in this case because greedy will make point 1 to pair with 3 and
making 2 and 4 pair but the best solution is point 1 and 3 with point 4 and 2.
1
3
4
Exercise 1.1.2
O(N! * (N-1!))
Exercise 1.1.3