OJ Board

Thank you so much!!

I'd thought an algorithm that similiar to the one proposed in the papaer

but I thought it would be O(N^2) in worst case, don't know it is O(N)

actually by amortized analyze...

Thank your so much!!!!

Hello everyone~

It's easy to solve MCS in O(N) with array of lenth N

here is another similiar question

Find the MCS with length not greater than L in O(N) (not O(NL))

Does anyone the algorithms to solve it?

any information will be great~

Thank you very much~

I did what the 3 rules say...but I still get WA
Can anyone please give some special case??
I have tried some cases and the answers seem correct...
Thank you very much

predicates which have the form CCVCV or CVCCV where C represents a consonant and V represents a vowel
"zaoya" is not a predicate under this rule.

As for the test cases it appears correct (tested it with AC program), but somehow I got one more "Bad!" output than yours. Perhaps you missed one line ...

predicates which have the form CCVCV or CVCCV where C represents a consonant and V represents a vowel
"zaoya" is not a predicate under this rule.

As for the test cases it appears correct (tested it with AC program), but somehow I got one more "Bad!" output than yours. Perhaps you missed one line ...

I search this forum and find a topic about P134
here are some test cases...
I got WA, too...

And can anyone please tell me why the answer of the test case
"du zaoya. " is "BAD!" ??
It is the grammar "DA PREDS",isn't it?? Do I misundertand anything??

thank you all very much... :)

INPUT:
le ...

I am now doing this problem....
and I got WA many times...
but I have tried all tests posted and my answers are the same
I can't figure out why I got WA, I am going mad~~
Can anyone please give me some more tests??
I am really appreciate for your help,Thank you very much.....

I have spend 3 weeks on this problem....
I implement a BigInteger class to solve this problem....but it's too slow...
I think there must be an effective algorithm to solve this problem...
I almost spent all of my time on this....
Can anyone please give me a hint,please??
Thank you very much
Thx ...

I have spend 3 weeks on this problem....
I implement a BigInteger class to solve this problem....but it's too slow...
I think there must be an effective algorithm to solve this problem...
I almost spent all of my time on this....
Can anyone please give me a hint,please??
Thank you very much

cytse wrote:Some input lines are quite long. Your character array is not large enough to get the whole line.

ya!!
Thank you very much!!!!!
That's it!!
I assume there are most 1024 chars per line,so.....>"<
I have got AC now,finally

Thank you very much!!

I made a time expensive solution for this problem, basically working with an struct with two integers, storing the pile and the pile position do the n indexes of my struct array, and spend a lot of time debugging my program.

Are lists the fastest way to do it? if (true) how do I work with lists ...

[quote="R

as the question describe
the first line of the test file will be an number N
and there will be N test cases....
the frist line of every case is a number m,then followed by n lines of data
then here is my code, I just read the in the data without doing anything
..........
int N,nLine,length;
char ...