作者:
炽热的
,
2023-05-13 15:00:16
,
所有人可见
,
阅读 23
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10;
int n;
int a[N];
int f[N], g[10];
string _to_string(int x) {
string res = "";
while (x) res = char(x % 10 + '0') + res, x /= 10;
return res;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i ++ ) cin >> a[i];
int res = 0;
for (int i = 1; i <= n; i ++ ) {
string t = _to_string(a[i]);
int head = t[0] - '0', tail = t[t.size() - 1] - '0';
f[i] = 1;
f[i] = max(f[i], g[head] + 1);
g[tail] = max(g[tail], f[i]);
res = max(res, f[i]);
}
cout << n - res;
return 0;
}
include[HTML_REMOVED]
using namespace std;
const int N=100010;
int t,a[N],b[10],c[10],f[N],z;
int main()
{ ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
cin>>t;
for(int i=1;i<=t;i)
{ cin>>a[i];
}
for(int i=1;i<=t;i)
{
int w=a[i]%10;
int s=0;
while(a[i])
{
s=a[i]%10;
a[i]=a[i]/10;
}
f[i]=1+c[s];
}
cout<<t-z;
}
大佬