Please visit this
linkhttp://www.techgig.com/codehire/ZSAssociates/problem/35.And
help me in solving this.
--
Thanks Regards
Gobind Kumar Hembram
Contact no.-+91867450
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
@atul..thnx 4 d link..
On 7/13/12, atul anand atul.87fri...@gmail.com wrote:
this question was discussed beforecheck solution i had posted..
link :-
https://groups.google.com/group/algogeeks/browse_thread/thread/91a17f7c78c2319e/991d1c2625a62ff0?hl=enlnk=gstq=rectangle+of+max+sum+MS+Q#
I have googled it but dint find explanation with an example.
here is the wiki link:
http://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm
Thanks,
Prakash.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
its from a running contest i believe.This is against the group policy as
well as against the ethics of programmers. The author of this post is
banned permanently from algogeeks. Kindly no more posts on this thread till
16th July (the date mentioned as end of contest in the given link).
Saurabh
As the final array contains element in stable-order, at any time we have 3
options for choosing the elements from A B.
1- A[i] A[i+1]
2- A[i] B[I]
3- B[i] B[i+1]
we will choose that pair whose product is maximum.
For ex:-
A-2,1,3
B-3,7,9
C- 3,7,2,9,1,3
Its a linear time solution with
I have written a mystrtok function which takes a string and a delimiter as
argument and returns an array of tokenized strings.But i don't know how to
traverse that array
Here is my code:-
char string[50] = asdf.sdf.sdf.sdf.wer.sfd.df;
char delim = '.';
char **result = mystrtok( string , delim);
ya that's right :( any other solution..
On Saturday, 14 July 2012 03:24:41 UTC+5:30, Dave wrote:
@Jatin: Take the array {1, 2, 4, 8, ..., x, 2, 4, 8, ..., x, x}, where x
is the largest power of two that will fit in your integer data type. Here 1
occurs once, 2, 4, 8, ... each occur twice,
total number of rows for the given input is 7.
so
for (int i=0; i7 ; i++)
printf(%s,result[i]);
On Sat, Jul 14, 2012 at 10:45 PM, Abhi abhi120...@gmail.com wrote:
I have written a mystrtok function which takes a string and a delimiter as
argument and returns an array of tokenized strings.But i
A set of integer values are being received (1 per day). Store these values
and at any given time, retrieve the min and max value over the last k days.
What data structures would you use for storing and retrieving ?
--
You received this message because you are subscribed to the Google Groups
Given Preorder and postorder traversals of a tree. Device an algorithm to
constuct a fully binary tree from these traversals.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/lZRdyZn85fcJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this
@naveen : 3*7+2*9+1*3 =42 is not maximum..
sum of the product would me maximum wen, i guess, most weighted elements
are adjacent
like in this case
if c={1,2,3,3,7,9}
1*2 + 3*3 + 7*9=74 (maximum )
thus this question is just merging both strings such resultant (here C) is
in sorted order which can
Hey guys!!
I am new to matrix exponentiation and its use in solving linear
recurrences..and have been trying to solve a problem which uses it. The
link to the problem is http://www.codechef.com/JULY12/problems/CSUMD.
I have tried understanding the code of the users who have submitted the
O(n2) Time and O(n2) space solution -
1. Total of (n2 + 2n - 2) products possible with given combinations - (n -
1) times (n + 1) and once n for the first array for the last element; total
of (n -1) products for 2nd array -therefore (n -1)(n +1) + n + (n-1) = n2
+ 2n - 2. Products to be
14 matches
Mail list logo
