OJ Board

I know but I wanna do it with DP.
This problem is like the partition problem with n subsets isn't?
It means that is NP-Complete?

Hi everyone, I need to do this problem with DP, but I can't figure out what I have to store, or how I have to divide the problem.
Here is my code, I did a DP function, but the thing is that some cases give a wrong answer, where is my mistake?

import java.io.*;
import java.util.*;
public class Main ...

but did you use backtracking?, can you send me your code please?

how have you resolved the problem ?

how have you resolved the problem?

I need help with this problem, I know how can be resolved, but i don't know how to write it in a program.
My idea is doing it with a grammar and a backtracking parser, when the parser can't read the word then, it's Trap!, other way is the instruction.
Please, i'd aprecciate if someone that knows how ...