Blog entries - Codeforces

By ACCEPT, 13 years ago, In English

Hi!

today i learn hungarian algorithm for maximum weighted graph . is the below condition true:

"the cost for the vertex are positive at the end of algo if the weight of edge are

non-negative."

thank's for your replay!

hungarian, weighted graph

By ACCEPT, 13 years ago, In English

i cant see the source code, like to post, write a comment. also the editor is disappear. why??? is this only for me or for All? hope it fixed.

bug

By ACCEPT, 13 years ago, In English

is there any function in C++ for set, that return the i-th element of set in O(lgn) or return the place of an element in set?

for example given a set S= {7,8,9,10,11}, then firsrt function for call 2 return 8 and second function for call 8 return 2.

sorry for my very poooooooooooooooor english!

c++, set

By ACCEPT, 13 years ago, In English

my code got this message for test #1, but it work's fine in my computer.

idlenesses

By ACCEPT, 13 years ago, In English

this code (360189) got AC, but in my computer for test #18, it's write:

NO
NO

but correct answer is:

YES

bug