Submission #1792510
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef pair<int, int> P; const int M = 1000000007; int main() { string s; cin >> s; int n = s.size(); int ans = n / 2; for (int i = 0; i < 26; ++i) { int ma = 0, c = 0; for (int j = 0; j < n; ++j) { if (s[j] == i + 'a') { ma = max(ma, c); c = 0; } else ++c; } ma = max(ma, c); ans = min(ans, ma); } cout << ans << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Shrinking |
User | riantkb |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 545 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |
1_05.txt | AC | 1 ms | 256 KB |
1_06.txt | AC | 1 ms | 256 KB |
1_07.txt | AC | 1 ms | 256 KB |
1_08.txt | AC | 1 ms | 256 KB |
1_09.txt | AC | 1 ms | 256 KB |