OJ Board

This problem can be solved by using the "Gomory - HU Tree of minimum cuts" algorithm, you can google for
more information .

Oh!! I think i make a big mistake... i transform the problem to the coin change one and solve it by DP... But due to the cyclic property, i can't always find the best solution :( ... I was too fool to make this mistake orz... and thank you very much!!! :) By the way, your blog is very usefull and a ...

Hi! Could you explain it clearly? I has a bottleneck in how to check the halting condition...because such as the third test case
5234 -> 1212, should i check 5234 -> 11212 -> 21212 -> 31212 -> ... ? By the way, Thank for your reply

Can someone tell me how to solve this problem with the correct algorithm? I saw many people solve this problem,
but i have no idea with it. Please help me orz...

Could someone help me with the problem??? I always got WA (about 50 times...) ! Could someone help me with my code? please :( #include <iostream> #include <vector> #include <algorithm> #include <cstdio> #include <cstdlib> #include <memory.h> #define MAX 10010 using namespace std; int root, N, ansnum...

Could someone give me a hint how to use a O(N^2) DP to solve this problem? I use a N^3 with TLE.

Thank you!! I think this problem will always convergence to the zero matrix (3x3) for every grid, but i can't prove this. Actually my AC program shows the
feature.

Hey! Finally i got AC, the mistake is that we should check each triple in the sorting sequence...
such as: 1 2 3 4 5 (index of decreasing order) => check (1,2,3) (2,3,4) (3,4,5), my original program will break if find a legal area which will be wrong!!

And thank all of your replay for my question

After i change the signal to %Lf, i still got WA...

I think this problem can't be a cycle...but why??? Can someone give me a proof please

Could someone help me with the problem? i got WA many times... :evil: My algorithm is to sort the sides in increasing order and using heron's formula to calculate the area. I think there can be precise error and overflow, so i use long double, is anything wrong?? Please help me :( Deleted after AC

How to reduce the problem into a edmon blossom? this graph has weight... i think it is a minimum weight perfect matching in a complete graph..
Am i wrong ?? or could somone give me a hint

Hey! i got AC use a O(nlogn) algorithm.. i want to know if there is a O(N) algorithm for solving this problem ?
Could somone tell me please

Could someone tell me how to solve the problem ? i increment the time one by one to check in which time they will get collision...
but TLE... is there a better algorithm for solveing this problem??

Could someone plz explain how to solve this problem using dijkstra?? I can't figure out how to process the multiple edge cost...