Search found 3 matches

by whateva
Thu Jul 23, 2009 7:07 pm
Forum: Volume 115 (11500-11599)
Topic: 11584 - Partitioning by Palindromes
Replies: 14
Views: 3825

Re: 11584 - Partitioning by Palindromes

the o(n^2) DP is like this : let's say that v stores the minimum number of group up to the i-th character. Then for every position j ( 0 <= j < i ), we check which one is the minimum one. That is, we only take every j in which the substring from j+1 to i is a palindrome, and we check if current v < ...
by whateva
Thu Jun 26, 2008 2:02 pm
Forum: Volume 101 (10100-10199)
Topic: 10187 - From Dusk Till Dawn
Replies: 50
Views: 18241

Re: 10187 - From Dusk till Dawn

no.. we must not mod the departing time with 24... mine didn't use any mod and still AC... so just use the "> 6 or < 18" rule of range for the departing time... ^^
by whateva
Fri Jun 20, 2008 8:33 am
Forum: Volume 110 (11000-11099)
Topic: 11027 - Palindromic Permutation
Replies: 18
Views: 11087

Re: 11027 - Palindromic Permutation

hi guys... i have tested my code for various cases, but still... it is WA... can anybody tell me what's wrong with my code or give any test case?
please help me... :(
thx before...

Code: Select all

at last AC... what a stupid mistake... ~_~

Go to advanced search