https://codeforc.es/problemset/problem/798/B
题意：n个串，每次操作可以将最前的放到最后，问最少操作使得全部串相同；
思路：这样放相当于将串加倍，找匹配的，暴力每个串取最小；
#include<algorithm> #include<set> #include<queue> #include<cmath> #include<cstring> #include<iostream> #include<set> #include<vector> #include<queue> #include<cmath> #include<cstdio> #include<map> #include<stack> #include<string> #include<bits/stdc++.h> using namespace std; #define sfi(i) scanf("%d",&i) #define pri(i) printf("%d\n",i) #define sff(i) scanf("%lf",&i) #define ll long long #define ull unsigned long long #define mem(x,y) memset(x,y,sizeof(x)) #define INF 0x3f3f3f3f #define eps 1e-16 #define PI acos(-1) #define lowbit(x) ((x)&(-x)) #define zero(x) (((x)>0?(x):-(x))<eps) #define fl() printf("flag\n") #define MOD(x) ((x%mod)+mod)%mod #define endl '\n' #define pb push_back #define lson rt<<1,l,mid #define rson rt<<1|1,mid+1,r #define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0) const int maxn=1e6+9; const int mod=1e9+7; inline ll read() { ll f=1,x=0; char ss=getchar(); while(ss<'0'||ss>'9') { if(ss=='-')f=-1;ss=getchar(); } while(ss>='0'&&ss<='9') { x=x*10+ss-'0';ss=getchar(); } return f*x; } double Dis(int x1,int y1,int x2,int y2) { return sqrt((double)(x1-x2)*(x1-x2)+(double)(y1-y2)*(y1-y2)); } string s[55],t[55]; int main() { //FAST_IO; //freopen("input.txt","r",stdin); int n; cin>>n; for(int i=0;i<n;i++) { cin>>s[i]; } int len=s[0].length(); for(int i=0;i<n;i++) t[i]=s[i]+s[i]; int Min=INF; for(int i=0;i<n;i++) { int ans=0; for(int j=0;j<n;j++) { if(j!=i) { int pos=t[j].find(s[i]); ans+=pos; } } Min=min(Min,ans); } if(Min==INF||Min<0) cout<<-1<<endl; else cout<<Min<<endl; return 0; }
