let me know the algorithm please

Why for n=6

aababbaa is OK
abbaabaa is WA ?

Who understands the statement or have AC please explain me
statement on some examples or say what does it mean

"The complexity of a name is defined as the minimal number of palindromes into which it can be decomposed. Help Vasechkin to invent the most complex name for his problem."

Thank you in advance

After sorting we have the problem of
finding maximal-sum submatrix
but it has O(n^3).
After additional thinking- all OK!
This is the way.For eaach row range [i1,i2]
it should  mantain set of nonzero columns
and number of such colums in mean must be 1-10

Pardon...Tle. Instead 1-10 really we have 500

Edited by author 19.10.2009 20:45

Keep in mind that: "An arithmetic expression in D++  may contain only symbols "=+-*/0123456789)(" and "end of line" symbols."

So, answer for the test:

(a)

NO

I use map<int,string> why it got MLE 5????

Edited by author 25.10.2008 18:30

Could anybody explain me what is the topological sorting. I don't understand well graphs. so what is this algorithm and how it can be realized? Send me e-mail please: shohruhhon1@mail.ru thanx in advance

a lot of thnx

#include<math.h>
#include<stdio.h>


int main()
{
    int t[100],n,m,i,j,tr[10010];
    scanf("%d",&n);
    scanf("%d",&m);
    for(i=1;i<=m;i++)
    {

                    scanf("%d",&t[i]);
    }
   for(i=1;i<=n;i++)
    {
                    if(i<=t[1])
                        tr[i]=2;
                    else
                    {
                        for(j=1;j<=m;j++)
                        {
                             if(i>t[j])
                             {printf("hhhhhhhhhhhh %d  %d  %d \n",i,t[j], tr[i-t[j]]);
                                if(tr[i-t[j]]==2)
                                    {tr[i]=1;
                                    printf("hahaha\n");
                                    break;
                                    }
                             }
                        }
                        if(j==m+1)
                            tr[i]=2;

                    }
                    printf("%d   %d\n",i,tr[i]);
    }

    printf("%d",tr[n]);


return 0;
}

I carried out input and output through files - received wrong answer 1.
Has cleaned files - accepted
**
Осуществлял ввод и вывод через файлы - WA1. Попробуйте эти файлы просто убрать :)

And this is my code

program ural1027;
const   ll='(*';
        rr='*)';

type    ts=ansistring;
var     s:ts;

procedure rd;
var     ch:char;
begin
 s:='';
 while not eof do
  begin
   read(ch);
   if (ch<>#13) and (ch<>#10) then s:=s+ch;
  end;
end;

procedure print(i:integer);
begin
 case i of
 0: write('NO');
 1: write('YES');
 end;
 halt;
end;

procedure dellr(var s:ts);
var  i,p,l:integer;


begin
 p:=pos(ll,s);
 l:=length(s);
 while p<>0 do
  begin
   i:=p+3;

   while (i<=l) and not ((s[i]=')') and (s[i-1]='*'))
    do inc(i);

   if (i>l) or (i=p+2) then print(0);

   delete(s,p,i+1-p);

   if s='' then print(1);
   p:=pos(ll,s);
   l:=length(s);
  end;

end;

procedure solve(s:ts);
var     p:integer;
        t:ts;
        ss:string;

 function cannot(t:ts):boolean;
 var    i,tot:integer;

 begin
  tot:=0;

  for i:=1 to length(t) do
   begin
    if s[i]='(' then inc(tot)
     else if s[i]=')' then dec(tot)
      else
       begin
        if not (s[i] in ['=','+','-','*','/','0'..'9',')','('])
            then exit(true);
       end;

    if tot<0 then exit(true)
     else if (tot>0) and (s[i]=' ') then exit(true);

   end;
  if tot<>0 then exit(true)
   else exit(false);
 end;

begin
 s:=s+' ';

 while s[1]=' ' do delete(s,1,1);
 p:=pos(' ',s);

 while (s<>'') and (p<>0) do
  begin

   t:=copy(s,1,p-1);
   if (pos('(',t)<>0) or (pos(')',t)<>0)
    then if cannot(t) then print(0);
   delete(s,1,p);

   while (s<>'') and (s[1]=' ') do delete(s,1,1);
   if s='' then break;
   p:=pos(' ',s);
  end;
end;

begin

 rd;

 dellr(s);
 solve(s);
 print(1);

end.


and if i remove the sentence
" if not (s[i] in ['=','+','-','*','/','0'..'9',')','('])
            then exit(true);"
I'll get WA#9

Who Can Tell Me WHY~~~~

Edited by author 27.10.2009 16:17

I got AC with 0.015s 189kB
Is it cool result????

I failed in the test#3 many times.But i think my program is right.who can tell me the data of test#3?

for 10 is the answer 55?

maybe test 90999 -> 91019 help you

Hi all! I have problems with test 7 and I wonder whether wrong idea causes it or not...
please, tell me, what the answer for

1000 1 498
0 -500

Is it 46.541438420 ?

thx.