#define _USE_MATH_DEFINES //M_PI(π),M_SQRT2(√2) #include //std::cout, std::cin #include //std::string,std::to_string(C++11) #include //std::vector #include //std::valarray #include //std::sort #include //localtime_s #include //abs #include //abs,std::pow,sqrt,sin,cos,round,floor,ceil #include //std::ifstream,std::ofstream #include //std::setprecision,std::setw,std::setfill #include //std::random(C++11) #include //std::accumulate #include //std::greater #include //std::list void UTF8_to_CodePoint(const std::string *str, std::vector &result) { std::string S = *str; int i = 0; unsigned char c = 0; while (i < S.size()) { c = S[i]; if (0 <= c && c < 128) { result.push_back(S[i]); i += 1; } else if (194 <= c && c < 224) { result.push_back(unsigned(S[i] & 0x1F) << 6 | S[i + 1] & 0x3F); i += 2; } else if (224 <= c && c < 240) { result.push_back(unsigned(S[i] & 0x0F) << 12 | unsigned(S[i + 1] & 0x3F) << 6 | S[i + 2] & 0x3F); i += 3; } else { result.push_back(unsigned(S[i] & 0x07) << 18 | unsigned(S[i + 1] & 0x3F) << 12 | unsigned(S[i + 2] & 0x3F) << 6 | S[i + 3] & 0x3F); i += 4; } } } int main(void) { //test用 //std::ifstream in("123.txt"); //std::cin.rdbuf(in.rdbuf()); std::string S; std::cin >> S; std::vector N; UTF8_to_CodePoint(&S, N); int max = 0, temp = 0; bool flg = false; for (int i = 0; i < N.size(); i++) { if (N[i] == 8230) { flg = true; temp++; } else { if (flg) { flg = false; if (temp >= max) { max = temp; } temp = 0; } } } if (flg) { if (temp >= max) { max = temp; } } std::cout << max << std::endl; }