OJ Board

I got several WA for this problem,
please give me some IO

please give me hint for solving this problem

I'm getting TLE, please give me hint

I got TLE, please give me idea.

I've tried too solve this problem with bell-man ford but I got getting TLE.
I repeat outer loop of bell-man ford while I have a update in inner loop.
Is this true?

does this problem have any critical input?
I got a lot WA for it.

how can I chek that is the polygon simple or not?
I think if I want check for it , my program will get TLE

how this problem can be solved?

thank u very mauch, but my program gives right answer to it,
I really got confused with this

I solved this problem greedy, and I got WA , please give me some test cases. I myself could'nt find

Is this reverese of max flow? I am not familiar with max flow very much, please help me doing this problem

I said that because somwhere for year 2002 I saw this :
"a slot in the World Finals may be given to best all-girl team in Asia."

Do you know somthing similar for this year?

Is there any rule for participating an all-girl team in world final?
I mean rule that gives positive chance to all-girl team

I use a similar algorithm:
first I find convex hull with O(nlgn) and then see if the point is inside the polygon or not with O(n).
but this give me TLE!

I tried to solve this problem with dynamic programming but got TLE,
Is there any greedy approach for solving this problem?