link : http://mirror.codeforces.com/gym/100548 My n^6 tree dp with constant optimal get Accepted. I think this problem's float point accuracy is harder than algorithm....it will take more effort to get "within an absolute error of 10−6" than thinking algorithm.....
using long double with some heuristic compute, my code's last example acurracy error is 8e-7.... dangerous Accepted...
Why don't you write Codeforces Rated Contests? I saw you making blogs about really hard problems which weren't solved by anyone (even tourist's team).
because my solving speed is too slow........
solving hard problems on contest is totally different with out of contest... if you have much patient it is enought....
Write ≠ solve a contest.
How about trying?
I think you can get high rating if you practice your solving speed (on easy problems).
If I have time, I'll try it,thank you for your suggest
Isn't LayCurse your account?
Nope,He is Janpanese,but I'm Chinese