Hello. Could anybody tell me how to solve this problem? (See in)

Someone said that it can be solved by Greedy. Just use net

flow to catch the largest number of "+". And then so. But

they all said that it is a wrong arithmetic. Could you tell

me your way to solve it?

Notice that someone includes sqr(5)

> Someone said that it can be solved by Greedy. Just use net

> flow to catch the largest number of "+". And then so. But

> they all said that it is a wrong arithmetic. Could you

tell

> me your way to solve it?

I've got ac with this idea. I wanna how to prove it.

> > Someone said that it can be solved by Greedy. Just use

net

> > flow to catch the largest number of "+". And then so.

But

> > they all said that it is a wrong arithmetic. Could you

> tell

> > me your way to solve it?

Re: I've got ac with this idea. I wanna how to prove it.

Posted by

Dwed 8 Apr 2004 21:50

You can't prove it, because there is a counter-eaxample:

2

+----

+----

+----

+----

+----

If Net flow works for most test cases, I think Match of Binary Graph also works

But I got a Output Limit , why?

Sorry, I've a simple mistake :(

Re: Hello. Could anybody tell me how to solve this problem? (See in)

Could you tell me what's the meaning of this problem?my english is noot good.The google translation is bad.