Search found 3 matches

by seckin
Sat Sep 05, 2009 3:45 pm
Forum: Volume 114 (11400-11499)
Topic: 11439 - Maximizing the ICPC
Replies: 4
Views: 3085

Re: 11439 - Maximizing the ICPC

you can do that with a binary search on the minimum edge weight combined with maximum matching in an arbitrary graph

can anyone provide us that arbitrary graph matching code?
I would accept PM too :)
by seckin
Sat Feb 21, 2009 4:53 pm
Forum: Algorithms
Topic: Non-Text Book Algorithms
Replies: 2
Views: 3285

Non-Text Book Algorithms

I realized that there are some algorithms which I get used to by solving problems instead of reading algorithm text books. like: ternary search, some query questions, method of dividing the problem into two equal sized problems( e.g : http://www.spoj.pl/problems/SUBSUMS ). I want to know the names o...
by seckin
Mon Feb 09, 2009 6:37 pm
Forum: Volume 115 (11500-11599)
Topic: 11553 - Grid Game
Replies: 10
Views: 3379

Re: 11553 - Grid Game

yes, it can be done using dp but before that i realized that BOB can take which number he wants from the board. so just choose the numbers with the minimum sum. it is enough to pass since i implemented it and passed in 0.030sec. BTW, i tried to solve it with DP too but get WA. i tried some test-case...

Go to advanced search