Merge pull request seeditsolution#247 from cadwellh5/patch-1

seeditsolution · web-flow · commit ac8d94c0b0ff · 2020-10-03T19:54:47.000+05:30
Maximum sum of increasing subsequence
diff --git a/MaxSumOfIncreasinSubsequence b/MaxSumOfIncreasinSubsequence
@@ -0,0 +1,16 @@
+ts=int(input())
+l3=[]
+l1=[]
+for j in range (ts):
+ n=int(input())
+ l3.clear()
+ li=list(map(int, input().split()))
+ for i in range(1,n):
+     t=li[i-1]
+     for j in range(0,i):
+      if(li[i]>li[j]):
+        t=t+li[j]
+     l3.append(t)
+ if(len(l3)!=0):  
+  print (max(l3))
+ li.clear()
