@kranthi :
d solution u ve given is only for 2 continuous elements..
wr as d question doesnt limit it to 2.. It can be d product of any no. of
continuous elements.
So if the array is 200, 5, -2, -3, -1
den ans shd be 200*5*-2*-3 = 6000
N if m workin ur algo in d right way, den it ll give 1000
On Wed, Jul 13, 2011 at 10:52 AM, kranthi kumar <damarlakran...@gmail.com>wrote:
> I think this is the solution what u need.... U can do in O(n) time...
>
>
>> #include<iostream>
>>> using namespace std;
>>>
>>> main()
>>> {
>>> int a[7] = { 0, 0, 0, 19, 380, -1, 2};
>>> int prod, nprod;
>>> bool x = false;
>>>
>>> for(int i=0;i<6;i++)
>>> {
>>> nprod = a[i] * a[i+1];
>>> cout<<nprod<<endl;
>>> if( x == false)
>>> {
>>> x = true;
>>> prod = nprod;
>>> }
>>> else if( x== true && prod < nprod )
>>> prod = nprod;
>>> }
>>>
>>> cout<<"\nResult: "<<prod;
>>> }
>>>
>>
>>
> --
> Regards:
> -----------------------
> D Kranthi kumar
> Computer Science & Engg.
> 1st Mtech, IIT Madras.
>
> --
> 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 unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
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 unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
