[ Web Proxy ]
URL:
Viewing: https://raw.githubusercontent.com/seeditsolution/pythonprogram/master/MaxSumOfIncreasinSubsequence [Back]  [Original]

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()

Web Proxy Viewer  |  New URL  |  Original Page