提出 #27528388

---

ソースコード 拡げる

//#pragma GCC optimize ("O2")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	string S;
	cin >> S;
	int K;
	cin >> K;
	int N = S.size();

	int L = 0, R = N + 1;
	while (L + 1 < R) {
		int wj = (L + R) / 2;

		int cnt = 0;
		rep(i, wj) cnt += (S[i] == '.');
		int OK = (cnt <= K);
		int nokori = N - wj;
		rep(i, nokori) {
			cnt -= (S[i] == '.');
			cnt += (S[i + wj] == '.');
			OK |= (cnt <= K);
		}
		if (OK) L = wj;
		else R = wj;
	}

	co(L);


	Would you please return 0;
}

提出情報

ジャッジ結果