def solve(s):
n = len(s)
dp = [0] * n
for i in range(n):
u = {}
for j in range(i, -1, -1):
u[s[j]] = u.get(s[j], 0) + 1
cost = len(u)
if j == 0:
dp[i] = max(dp[i], cost)
else:
dp[i] = max(dp[i], cost + dp[j - 1])
return dp[n - 1]
# Test input
s = "abcabc"
print(solve(s))
IApkZWYgc29sdmUocyk6CiAgICBuID0gbGVuKHMpCiAgICBkcCA9IFswXSAqIG4KCiAgICBmb3IgaSBpbiByYW5nZShuKToKICAgICAgICB1ID0ge30KCiAgICAgICAgZm9yIGogaW4gcmFuZ2UoaSwgLTEsIC0xKToKICAgICAgICAgICAgdVtzW2pdXSA9IHUuZ2V0KHNbal0sIDApICsgMQoKICAgICAgICAgICAgY29zdCA9IGxlbih1KQoKICAgICAgICAgICAgaWYgaiA9PSAwOgogICAgICAgICAgICAgICAgZHBbaV0gPSBtYXgoZHBbaV0sIGNvc3QpCiAgICAgICAgICAgIGVsc2U6CiAgICAgICAgICAgICAgICBkcFtpXSA9IG1heChkcFtpXSwgY29zdCArIGRwW2ogLSAxXSkKCiAgICByZXR1cm4gZHBbbiAtIDFdCgoKIyBUZXN0IGlucHV0CnMgPSAiYWJjYWJjIgoKcHJpbnQoc29sdmUocykpCg==