Discussion @ 1181. Cutting a Painted Polygon @ Timus Online Judge

O(n^3) gets TLE. Can anyone give me a better hint?

Posted by asif 23 Feb 2002 23:52

My mail: bsc98001@yahoo.com

Re: O(n^3) gets TLE. Can anyone give me a better hint?

Posted by Gheorghe Stefan 24 Nov 2002 21:17

> My mail: bsc98001@yahoo.com

Try to eliminate all RGB consecutive but be aware to not "destroy" a
rare node (i.e. eliminate them in descending order)

Re: O(n^3) gets TLE. Can anyone give me a better hint?

Posted by ASK 17 Mar 2010 20:04

What seems to be O(n^3) DP is AC as far as you remember to use "break"

Discussion of Problem 1181. Cutting a Painted Polygon