Seals's blog

Can anyone give me some help
By Seals, 12 years ago, In English

I have trouble with this problem:

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=76&page=show_problem&problem=2385

I thought it is the same as this problem:

http://www.spoj.pl/problems/PROFIT/

I thought it is a maximum closure problem and I solved it using network flows, but I failed on the first one. Can anyone tell me why or give me some hints?

  • Vote: I like it
  • +1
  • Vote: I do not like it

»
12 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Can you provide working link to the first problem?
UPD: The link is actually works in FF, but opera can't open it.

→ Reply
»
12 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I think this is what you need.

→ Reply
  • »
    »
    12 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I know it is a maximum closure problem actually, however, I got WA, and I want to find out why it's not correct.

    → Reply