OJ Board

I got TLE too...

I thought,
1. if A and B has same sign ,
2. K is minus in A + BK = 0.

but how can i upgrade my process from O(n^3) to O(n^2) or O(n)?

I used three loop ( n^2 * pp ) , but i couldn't find out more good algrothm.

Plsase suggest me something better


-JSKim@CAC wrote-

hello : )

I'm JSKim@CAC.



My E-mail address in ACM site is too old version.
(in fact i stopped it last year.)

And of course I wanna change into my using e-mail address...
but 'Update info' in ACM site is disabled.

How can i change my profile infomation in ACM site? (not this board info ...

yup, in first time, i used quick sort & insertion sort, but TLE...

and i used priority_queue (stl) and got AC.

THX alot!!

-JSKim/valfiros-

Oh my god...I did absolutely same mistake...
(and got WA over 20 time, about 4 hours, saying "what the @%^"...)
thx alotttt!

-JSKim-

#include <stack>
#include <stdio.h>

using namespace std;
void sub();

void main()
{
unsigned int case_num;
scanf("%d",&case_num);
for(unsigned int i=0;i<case_num;i++)
sub();
}

void sub()
{
stack <char> k; // stack
unsigned int istrue=1; // flag
char array[130];
char * cpt;

fflush ...