Submission #1359982
Source Code Expand
#include<iostream> #include<algorithm> #include<string> using namespace std; string s; bool d[110]; int main(){ int ans=114514; cin>>s; for(int i=0;i<s.size();i++)d[i]=false; for(int i=0;i<s.size();i++){ if(d[i]==false){ int cnt=i,bef=i; for(int j=i+1;j<s.size();j++){ if(s[j]==s[i]){ cnt=max(cnt,j-bef-1); bef=j; d[j]=true; } } int r=s.size()-bef-1; cnt=max(cnt,r); ans=min(ans,cnt); } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Shrinking |
User | ynymxiaolongbao |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 498 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 |