Codeforces 443 B Kolya and Tandem Repeat【暴力】

 1 #include<iostream>  
 2 #include<cstdio>  
 3 #include<cstring> 
 4 #include <cmath> 
 5 #include<stack>
 6 #include<vector>
 7 #include<map> 
 8 #include<set>
 9 #include<queue> 
10 #include<algorithm>  
11 using namespace std;
12 
13 typedef long long LL;
14 const int INF = (1<<30)-1;
15 const int mod=1000000007;
16 const int maxn=100005;
17 char s[maxn];
18 int len;
19 
20 
21 int main(){
22     int k;
23     cin>>s;
24     int len=strlen(s);
25     cin>>k;
26     for(int i=len;i<len+k;i++) s[i]=‘*‘;
27      
28      int  ans=-1;
29      len=len+k;
30     for(int i=0;i<len;i++){
31         for(int j=1;2*j+i<=len;j++){
32             int flag=1;
33             for(int t=i;t<i+j;t++){
34                 if(s[t]!=s[t+j]&&s[t+j]!=‘*‘) {
35                     flag=0;
36                     break;
37                 }
38             }
39             if(flag) ans=max(ans,j*2);
40         }
41     }
42     
43     printf("%d\n",ans);
44     return 0;    
45 }