fork download
  1.  
  2. def solve(s):
  3. n = len(s)
  4. dp = [0] * n
  5.  
  6. for i in range(n):
  7. u = {}
  8.  
  9. for j in range(i, -1, -1):
  10. u[s[j]] = u.get(s[j], 0) + 1
  11.  
  12. cost = len(u)
  13.  
  14. if j == 0:
  15. dp[i] = max(dp[i], cost)
  16. else:
  17. dp[i] = max(dp[i], cost + dp[j - 1])
  18.  
  19. return dp[n - 1]
  20.  
  21.  
  22. # Test input
  23. s = "abcabc"
  24.  
  25. print(solve(s))
  26.  
Success #stdin #stdout 0.08s 7932KB
stdin
Standard input is empty
stdout
6