UVa OJ Board

two ways to do it
1) qsort then binary search
2) binary search tree is also an option
think about it ... you will get the idea

thanx man. you are a great helper

http://riyad13783.googlepages.com/pack.gif i forgot to give the picture of the 6 basic layouts. i wrote all the formulas in one of my previous post. could some one check those and tell me weither my formulas are correct or not. i will remove all my post as soon as i get accepted in this problem. by...

any one please help me with this problem. i am still stuck in this section. please help.thanx in advance
bye
Riyad

but i get this output for your input. could you tell what am i doing wrong?please help..... what is ur output for i get is it right????

can't get AC still :( can anyone please help. below is my code # include <stdio.h> # include <assert.h> typedef long long i64 ; i64 memo[250][20]; i64 go( int sum , int n ){ i64& ret = memo[sum][n]; if(ret !=-1) return ret ; if( !sum && !n ) return ret = 1 ; ret = 0 ; int i ; for( i = 1 ; i <= sum &...

i am getting WA in this problem. could anyone provide more testcases. boundary cases would be very nice. i got correct results for all the above i/o. please help....

hello, thank you for the help. im not good at geometry. so i am not confident about finding the height and width of the different scenarios case 1 : 1 2 3 4 H = max4(h1,h2,h3,h4); W = w1+w2+w3+w4 ; case 2: (1 2 3) 4 H = max3(h1,h2,h3)+h4; W = max2( w4,w1+w2+w3); case 3 : ( 1 2 ) 4 3 H = max2( h4, ma...

Four rectangles are given. Find the smallest enclosing (new) rectangle into which these four may be fitted without overlapping. By smallest rectangle, we mean the one with the smallest area. All four rectangles should have their sides parallel to the corresponding sides of the enclosing rectangle. ...

luison9999 is right . the output for case 4 and case 7 is wrong . the output should be 5 and 17 respectively ...it did make me confused but i submitted before matching these given outputs with mine

would u care to tell us your DP solution which runs in O(n^3) iLL be really glad to know one if u dont want to give a spoiler u can PM me ur idea , anywayz thanx for ur reply ...

is dp the obvious choice to go for this problem ?? and can some one tell me whats the complexity of the DP .....
is it O(nk) ???????????????
thanx in advance

is there any O(n^3 ) dp for this problem . i used O(n^4) dp to get accepted during the contest which is getting TLE in the judge now . so can some one point out the O(n^3) algorithm or O(n^4) is way to go .........
thanx in advance

try to find some formula for this problem ..... no backtracking needed ...

i cant find any suitable way to solve this problem . can some one give me some hints ??? is there formula needed or simulation is the way to go ???
please help
Thanx in advance