I heard there exists a O(n) algorithm in DP? Does anyone has the idea about it?
On 11 September 2013 03:21, Aaquib Javed <[email protected]> wrote: > http://www.geeksforgeeks.org/maximum-of-all-subarrays-of-size-k/ > > > On Tue, Sep 10, 2013 at 11:46 PM, kumar raja <[email protected]>wrote: > >> suppose we have n numbers and k <=n. >> >> Then a1,a2... ak is one set. >> >> then a2,a3.... ak+1 is other set. >> ... >> so totally we can have n-k+1 sets. >> >> how to figure out the maximum elements of all these k size sets with >> least possible time complexity and space complexity? >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To unsubscribe from this group and stop receiving emails from it, send an >> email to [email protected]. >> > > > > -- > Aaquib Javed > B.Tech. Final Year > Electronics & Comm Engineering > MNNIT Allahabad. > +91-8953519834 > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected].
