one thing i don't understand: in output requirement, it says "maximum weight of increasing subsequence". in example explanation, it says "maximum size of increasing subsequence is still 4". so is ''maximum size of increasing subsequence" a must for the answer, or any size of increasing subsequence acceptable?

It can be solved with a kind of insertion sort, in a grouped list, where the groups will be responsible for reducing the complexity of the operation, I did it this way with groups of size sqrt(N), so the complexity was in O(sqrt( N)), there may be better ways out there, such as an AVL tree, but as the implementation would be much larger, I preferred to do it that way.

Garden landscaping parks and children playing product available for further detail please check this Garden decore

The max size rising sequence is four, and there's only one of them. In the second sequence, the max size rising subsequence is still around four, but there are five possible subsequences in it. Meanwhile, you can checkout some pet care supplies coupon code

Best Savings Coupon is the most trusted and top-rated online platform providing the best deals, coupons, and promo codes. Our expert team searches for the latest working deals to help you save more. In short, we are here to help you with finding the best online deals, coupons, and promo codes for multiple products like travel packages, party goods, computer & electronic accessories, fashion & designer clothing, home décor, and many more all at one place. Brandsmart USA Coupon