Patch for /trunk/Subseq_cover.cpp

[GoogleCodeExporter]

Since all the elements in Q is distinct, we would go into this if statement 
only once, so there is no need and will never update a existed value res twice.

Original issue reported on code.google.com by tplee...@gmail.com on 21 Apr 2013 at 8:44

Attachments:

• Subseq_cover.cpp.patch

[GoogleCodeExporter]

I am not so sure about this one since although all elements in Q are distinct, 
we may have duplicate elements in A such that we may update D.back() which 
means we need to check that.

Original comment by TsungHsi...@gmail.com on 1 May 2013 at 12:31