Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- n=int(input())
- while n>0:
- s=input()
- t=len(s)
- l=[[0 for i in range(0,t)] for j in range(0,t)]
- m=[[-100 for i in range(0,t+1)] for j in range(0,t+1)]
- r=[]
- for i in range(0,t):
- l[i][i]=0
- m[i][i+1]=i
- for cl in range(2,t+1):
- for i in range(0,t-cl+1):
- j=i+cl-1
- if i==0 and j==6:
- a=1
- if s[i]==s[j] and cl==2:
- l[i][j]=2
- elif s[i]==s[j]:
- l[i][j]=l[i+1][j-1]+2
- m[i][j]=m[i+1][j-1]
- else:
- l[i][j]=max(l[i][j-1],l[i+1][j])
- m[i][j]=m[i][j-1] if l[i][j-1] > l[i+1][j] else m[i+1][j]
- d=l[0][t-1]//2
- print(str(d)+' '+str(m[0][t-1]))
- n-=1
Add Comment
Please, Sign In to add comment