昨天晚上cf比赛题目链接
思路:枚举区间长度,在枚举区间里面的对应的点,如果满足条件就返回ans;
代码:
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
void solved()
{
string s; cin>>s;
int l=s.size();
s='$'+s;
int ma=0;
for(int i=1;i<=l/2;i++)
{
int ans=0;
for(int j=1;j+i<=l;j++)
{
if(s[j]==s[j+i]||s[j]=='?'||s[j+i]=='?')
{
ans++;
}
else ans=0;
if(ans==i)
{
ma=ans;
break;
}
}
}
cout<<ma*2<<'\n';
}
int main()
{
int t; cin>>t;
while(t--)
solved();
}
还有一题是牛客之前比赛的题,感觉很好也是考察了滑动窗口和前缀和题目链接
#include<bits/stdc++.h>
using namespace std;
using LL = long long;
const int N = 1e5 + 7;
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, k;
cin >> n >> k;
string S;
cin >> S;
int ans = 0;
S = '!' + S;
int cnt = 0;
vector<int> s(n + 1), s2(n + 1);
for (int i = 1; i <= n; ++i) {
cnt += (S[i] == '1'); //字符串中1的个数
s[i] = s[i - 1] + (S[i] == '0'); //第i位前0的个数
s2[i] = s2[i - 1] + (S[i] == '1'); //第i位前1的个数
}
for (int i = 1; i + k - 1 < s.size(); ++i) {
int t = s[i + k - 1] - s[i - 1];
int T = cnt - (s2[i + k - 1] - s2[i - 1]);
if (t == 0 && T == 0) { //k位中没有0;k位中的1位所有1;
++ ans;
}
}
if (ans == 0)cout << "delicious\n";
else cout << ans << '\n';
return 0;
}