OJ Board

shahriar_manzoor wrote:

There are ways to find medians in linear time

But I can't understand How I find medians in linear time ? I use partition method that use quick sort.
But it's worst case complexity is O(nlogn)

Please some one help me to get medians in linear time.

I don't understand why I get wa in this easy problem.
The idea is easy. (Bsearch)
But what is the reson of wa.
Can any one give any correction ?
Here My code



#include <stdio.h>
#include <math.h>
#define esp 0.000001

double pi,r,p;

double area(double rp) {
double x,y,theta,arp,ar;
x = (rp*rp ...

why DFS not work here.
But BFS working
I get AC using BFS

Does Any one know that Java support BigInteger Class ?
I am new in java.
Please Help me.
Bye

Hello
Can any one explain what is NP Complete.
And what the use of NP Complete.
Thanks

I don't know where the error of my code. Why it produce wrong when big number is given.Please some one help me.
Here my code

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

void main() {
long double n,R,r,t,bluearea,greenarea,pi,pi_n,t1;
pi = 2.0 * acos(0);
while(scanf("%Lf%Lf",&R,&n) != EOF) {
if(n==1 ...

Thanks Andrey
You are right, i want to find the least possible number of exchanges.
Your method is first, but I can't understand the term "cycle".
Why 4 2 3 1 is written (14)(2)(3) why not (14)(23).
and how 4 2 3 1 => (14)(2)(3).
do we make a left shift then place 1 at first or not?
I can't ...

Someone please help me to find the number of swap operation need to sort a set of data. For example if data set is 4 2 3 1 then only one swap opration is enough to sort in increasing order. Here we just swap 4 and 1.

ThankYou Very Much