Multiplication can be converted to addition by adding the log (ln).
Then you need to find maximum sub array which sums to maximum.
regards
Arunachalam.
On 4/25/07, Bootlegger <[EMAIL PROTECTED]> wrote:
>
>
> We've all seen the maximum sum contiguous subarray problem, but heres
> a new take on i
On 4/25/07, Ravi <[EMAIL PROTECTED]> wrote:
>
> What is the type of following grammar:
> S -> aXY
> XY -> a
Context-sensitive grammar.
I'm not sure if context-sensitive grammars have been subclassed to
cover something like this in particular.
> X -> b
> Y -> Xb
>
--
Regards,
Rajiv Mathews
-
1. If the array contains even number of negative numbers, then the answer is
the whole array.
2. If it contains odd number of negative integers, split the array on every
negative integer and calculate the product of two subarrays. Find the
subarray (among all the subarrays from every split) with ma
Aye its not the same,
I suspect the answer will have something to do with verifying the
number of negative numbers in the subarray, seen as a even number of
negative numbers will produce a positive product and an odd number of
negatives will produce a negative product.
Bootlegger
On 25 Apr, 13:
> I think the problem is same as maximum sum..since product is max. if sum
> is max. only thing we have to verify is that we should get even number of
> negative numbers in our product..
Its not the same.
Consider the sequence:
50, -25, -25
Max. Sum subarray : 50
Max. Product subarray: 50, -25,
Hi,
I think the problem is same as maximum sum..since product is max. if sum is
max. only thing we have to verify is that we should get even number of
negative numbers in our product..
On 4/25/07, Bootlegger <[EMAIL PROTECTED]> wrote:
>
>
> We've all seen the maximum sum contiguous subarray probl
We've all seen the maximum sum contiguous subarray problem, but heres
a new take on it: maximum PRODUCT contiguous subarray:
Suppowe we have an array A[1 to n] of n integers (positive and
negative), Find the maximum product found in any contiguous subarray
and produce the pseudo-code for in.
I'v
We've all seen the maximum sum contiguous subarray problem, but heres
a new take on it:
Say we are given an array A[1 to n] of n inte-gers (positive and
negative), we need to find the maximum product found in any contiguous
sub-array.
I've had a crack at this and im struggling apparently it can
Yes I agree, please for the love of GOD ban this person.
On 4/25/07, Shashi Kant <[EMAIL PROTECTED]> wrote:
>
> Oh Come on moderators Ban this guy. I have had enough of his crap
> !
>
>
>
>
> On 4/25/07, candra < [EMAIL PROTECTED]> wrote:
> >
> >
> > This course on certified ethical hacker
Oh Come on moderators Ban this guy. I have had enough of his crap !
On 4/25/07, candra <[EMAIL PROTECTED]> wrote:
>
>
> This course on certified ethical hacker will explore the existence and
> the use of hacking tools and security systems in any network
> environment. Within each domain
What is the type of following grammar:
S -> aXY
XY -> a
X -> b
Y -> Xb
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsu
PHREAKS !!! Part 1
1 GENERAL - General Information About the Phone Company
1.1 Hacking Answering Machines and Voice Mail
1.2 Phreaking Programs
2 BOXES - Coloured Boxes - Electronic Toll Fraud and Other Phone
Devices
2.1 The Fixer's Box Review - Read this before you read the rest of
these files
This course on certified ethical hacker will explore the existence and
the use of hacking tools and security systems in any network
environment. Within each domain, you will be presented with several
tools that a hacker can use, and which countermeasures are most
effective against their use.
Some
Pirates of Silicon Valley Entire movie
http://www.teenwag.com/playvideo/4294
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
T
Pirates of Silicon Valley Entire movie
http://www.teenwag.com/playvideo/4294
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
T
15 matches
Mail list logo
