#include <iostream>
#include <string.h>
#include <algorithm>
#include <vector>
using namespace std;
string s;
int n, k, sta, ans;
char p;
struct node {
int id;
char p;
}arr[200010];
bool cmp(node a, node b) {
return a.p < b.p;
}
int main()
{
while (cin >> n >> k)
{
ans = 9999999;
for (int i = 0; i < n; i++) {
arr[i].id = i;
}
cin >> s;
for (int i = 0; i < n; i++) {
arr[i].p = s[i];
}
stable_sort(arr, arr + n, cmp);
for (int i = 0; i < n - 1; i++) {
if ((i + k - 1) < n && arr[i].p == arr[i + k - 1].p) {
ans = min(ans, abs(arr[i].id - arr[i + k - 1].id));
}
}
if (ans!=9999999) cout << ans + 1 << endl;
else cout << -1 << endl;
}
}
g题我有这样一种思路,但是只能过90%的数据,请问大家这种思路可行吗,如果可行错在哪里?
全部评论
(1) 回帖