跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2187. Diverse Substrings

  • ID: 2193
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:提高
  • 上传者:
  • 动态规划
  • 字符串
  • 双指针
  • 算法思想
  • 提高
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Diverse Substrings

题目描述

C. Diverse Substrings
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

String diversity is the number of symbols that occur in the string at least once. Diversity of s will be denoted by d(s). For example , d("aaa")=1, d("abacaba")=3.

Given a string s, consisting of lowercase Latin letters. Consider all its substrings. Obviously, any substring diversity is a number from 1 to d(s). Find statistics about substrings diversity: for each k from 1 to d(s), find how many substrings of s has a diversity of exactly k.

Input

The input consists of a single line containing s. It contains only lowercase Latin letters, the length of s is from 1 to 3·105.

Output

Print to the first line the value d(s). Print sequence t1,t2,...,td(s) to the following lines, where ti is the number of substrings of s having diversity of exactly i.

Examples
Input
abca
Output
3
4
3
3
Input
aabacaabbad
Output
4
14
19
28
5
Note

Consider the first example.

We denote by s(i,j) a substring of "abca" with the indices in the segment [i,j].

  • s(1,1)= "a", d("a")=1
  • s(2,2)= "b", d("b")=1
  • s(3,3)= "c", d("c")=1
  • s(4,4)= "a", d("a")=1
  • s(1,2)= "ab", d("ab")=2
  • s(2,3)= "bc", d("bc")=2
  • s(3,4)= "ca", d("ca")=2
  • s(1,3)= "abc", d("abc")=3
  • s(2,4)= "bca", d("bca")=3
  • s(1,4)= "abca", d("abca")=3

Total number of substring with diversity 1 is 4, with diversity 2 equals 3, 3 diversity is 3.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1791 题。保留原作者与原赛事署名。