i agree with the logic....i also implemented it...and getting TLE...there
must exist some better method :(
On Fri, Jun 10, 2011 at 2:18 AM, kartik sachan <kartik.sac...@gmail.com>wrote:
> what i understand from the problem was that.............
> n no of higests are given
> and a and b and city no i.e from city a a ball is thrown to city no b
> so i have done
>
> from array a[] i.e hieght { n.......no of times}
> find all the element between b[i].............city A and
> c[i]................city B
> then check IF value of b[i] is greater than all the element occur between
> them if yes then count++
> else count remain same
>
>
>
> if any thing worng plzz expain
>
> --
> 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.
