Can you please further explain the recurrence in the DP.
The Major problem with my DP , is for a maximum word with length N (a1.........aN) it may not contain any string in which a1...ax is that position Maximum. Because a1.....aN may contain more substrings which will give it a large value and then the solution will fail.
My previous 3 submissions for this problem are rejected because of this.
For example consider this example 3 substring with following values
bac 7
acb 5
def 8
For finding the string with largest value for length 6
DP solution will yield "defdef" value 16 but the answer is bacbac value 19.
regards
Arunachalam.
On 6/30/06, daizi sheng <[EMAIL PROTECTED]> wrote:
is DP ok?
2006/6/30, Arunachalam <[EMAIL PROTECTED] >:
>
> Hi,
> I am thinking a solution to this question for long time. But could
> not make it. Can anyone try and give some idea about this problem?
>
> http://acm.mipt.ru/judge/problems.pl?problem=014
>
> --
> ===================================
> want to know more about me
> http"//ww.livejournal.com/users/arunachalam
> >
>
--
myblog: http://gnor.net/daizisheng/blog/
--
===================================
want to know more about me
http"//ww.livejournal.com/users/arunachalam
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
