@sunny: right thanks for correcting On Wed, Jul 13, 2011 at 11:33 AM, sunny agrawal <[email protected]>wrote:
> @Aniket Dutta > Solution for your case will be 96 > > Algorithm Posted by Oppilas will do and is O(n). > > > On Wed, Jul 13, 2011 at 11:28 AM, Aniket Dutta <[email protected]>wrote: > >> @vaibhav: Sir ur algo fails in this array {2,-8,-3,1,2} it should give >> answer as 24 but ur algo gives 2 >> >> >> On Wed, Jul 13, 2011 at 11:02 AM, varun pahwa >> <[email protected]>wrote: >> >>> please ignore my previous post that solution is wrong. >>> >>> >>> On Wed, Jul 13, 2011 at 11:01 AM, [email protected] < >>> [email protected]> wrote: >>> >>>> @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 < >>>> [email protected]> 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 [email protected]. >>>>> To unsubscribe from this group, send email to >>>>> [email protected]. >>>>> 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 [email protected]. >>>> To unsubscribe from this group, send email to >>>> [email protected]. >>>> For more options, visit this group at >>>> http://groups.google.com/group/algogeeks?hl=en. >>>> >>> >>> >>> >>> -- >>> Varun Pahwa >>> B.Tech (IT) >>> 7th Sem. >>> Indian Institute of Information Technology Allahabad. >>> Ph : 09793899112 >>> Official Email :: [email protected] >>> Another Email :: [email protected] >>> >>> People who fail to plan are those who plan to fail. >>> >>> -- >>> You received this message because you are subscribed to the Google Groups >>> "Algorithm Geeks" group. >>> To post to this group, send email to [email protected]. >>> To unsubscribe from this group, send email to >>> [email protected]. >>> 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 [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > Sunny Aggrawal > B-Tech IV year,CSI > Indian Institute Of Technology,Roorkee > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
