After ordering, you can solve it like the Longest Increasing Sequence (LIS)
problem, using Dynamic Programming.
2010/5/19 bob198107
> Hi.
> First: I'm new in ACM. 2 day took me to find out how to read and write
> data in the tasks. There should be some sample code for beginners for
> this.
> Sec
Hi.
First: I'm new in ACM. 2 day took me to find out how to read and write
data in the tasks. There should be some sample code for beginners for
this.
Second: For me it is not clear what should be done, even if I read the
text of the tasks few times. I wonder if I am so intellectually
limited or it
