Search found 13 matches

by cplusplus
Sat Nov 19, 2005 8:58 pm
Forum: Algorithms
Topic: MCS in length L(Maximum consecutive subsequence in length L)
Replies: 2
Views: 1059

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!!!! :D
by cplusplus
Fri Nov 18, 2005 8:06 pm
Forum: Algorithms
Topic: MCS in length L(Maximum consecutive subsequence in length L)
Replies: 2
Views: 1059

MCS in length L(Maximum consecutive subsequence in length L)

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~
by cplusplus
Wed Nov 26, 2003 6:03 pm
Forum: Volume 105 (10500-10599)
Topic: 10510 - Cactus
Replies: 31
Views: 22809

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 :)
by cplusplus
Wed Nov 19, 2003 12:27 am
Forum: Volume 1 (100-199)
Topic: 134 - Loglan-A Logical Language
Replies: 45
Views: 4618

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 wh...
by cplusplus
Sun Nov 16, 2003 9:07 am
Forum: Volume 1 (100-199)
Topic: 134 - Loglan-A Logical Language
Replies: 45
Views: 4618

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 wh...
by cplusplus
Sat Nov 15, 2003 10:50 am
Forum: Volume 1 (100-199)
Topic: 134 - Loglan-A Logical Language
Replies: 45
Views: 4618

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 bcade ga f...
by cplusplus
Mon Apr 07, 2003 11:28 pm
Forum: Volume 104 (10400-10499)
Topic: 10410 - Tree Reconstruction
Replies: 13
Views: 9162

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~~ :cry:
Can anyone please give me some more tests??
I am really appreciate for your help,Thank you very much.....
by cplusplus
Sun Mar 23, 2003 11:29 am
Forum: Volume 5 (500-599)
Topic: 504 - Random number
Replies: 1
Views: 1600

Re: 504 te

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, ev...
by cplusplus
Fri Mar 21, 2003 1:15 am
Forum: Volume 5 (500-599)
Topic: 504 - Random number
Replies: 1
Views: 1600

504 - Random number

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
by cplusplus
Mon Feb 10, 2003 3:35 pm
Forum: Volume 2 (200-299)
Topic: 283 - Compress
Replies: 16
Views: 6221

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!!
by cplusplus
Fri Feb 07, 2003 10:47 pm
Forum: Volume 1 (100-199)
Topic: 101 - The Blocks Problem
Replies: 635
Views: 40347

Re: 101 - Fastest way to do

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? I ...
by cplusplus
Fri Feb 07, 2003 10:42 pm
Forum: Volume 1 (100-199)
Topic: 104 - Arbitrage
Replies: 223
Views: 14329

[quote="R
by cplusplus
Fri Feb 07, 2003 10:32 pm
Forum: Volume 2 (200-299)
Topic: 283 - Compress
Replies: 16
Views: 6221

The input of 283,please help me,thank you

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 lin...

Go to advanced search