it is difficult to read code and understand but based on the logic u
mentioned in 3 points i just want to know if u also have taken care of the
case where
u have zero points in the array and as u say find each product around 0
points, do u check within each subarray around the zero point if the
given an array containing +ve n -ve numbers , can someone give
efficient algo to find the max cont subarray product.
this is same as problem http://online-judge.uva.es/p/v110/11059.html.
here is the code for this one:
#include cstdio
#include iostream
#include algorithm
#include limits.h
using
given an array containing +ve n -ve numbers , can someone give
efficient algo to find the max cont subarray product.
--
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
