提出 #47727313

---

ソースコード 拡げる

#!/usr/bin/env python
# coding: utf-8
import sys
import itertools

def i_in(): return int(sys.stdin.readline().rstrip())
def li_in(): return list(map(int, sys.stdin.readline().rstrip().split()))
def s_in(): return sys.stdin.readline().rstrip()
def ls_in(): return list(sys.stdin.readline().rstrip().split())


def solve1():
    n = i_in()
    s = s_in()
    ss = set(s)

    ss_darr = [[0 for i in range(n)] for j in range(len(ss))]
    for ss_i, ss_v in enumerate(ss):
        for i in range(len(s)):
            if s[i] == ss_v:
                if i == 0:
                    ss_darr[ss_i][i] = 1
                else:
                    ss_darr[ss_i][i] = ss_darr[ss_i][i - 1] + 1
            else:
                ss_darr[ss_i][i] = 0
    print(sum(map(max, ss_darr)))
    # for i in range(len(ss)):
    #     subst_dic[ss[i]] = 1
    # for i in range(n - 1):
    #     for j in range(i + 1, n):
    #         q = s[i:j]
    #         if not q in ss:
    #             ss.add(q)
    #         if any(ss[i:j] in )
    


def main():
    solve1()


if __name__ == '__main__':
    main()

提出情報

ジャッジ結果