希望以后别人会看到你背后的努力,而不是只会看到你外表所呈现和他自己想象的结果。
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<cstdlib>
#include<stack>
#include<queue>
#include<set>
#include<vector>
#include<map>
#include<ctime>
#include<cctype>
#include<bitset>
#include<utility>
#include<sstream>
#include<iomanip>
#include<typeinfo>
#define inf 0x3f3f3f3f
typedef long long ll;
using namespace std;
priority_queue<int,vector<int>,greater<int> >q;
int K;
ll sum=0;
string s;
vector<int>A,B;
bool checkA(int i,int len){
if(len-i<5)
return false;
return s[i+1]=='l'&&s[i+2]=='i'&&s[i+3]=='c'&&s[i+4]=='e';
}
bool checkB(int i,int len){
if(len-i<3)
return false;
return s[i+1]=='o'&&s[i+2]=='b';
}
int main(){
cin>>K;
getchar();
getline(cin,s);
int cd=s.size();
int cda,cdb,r=0,l=0;
for(int i=0;i<cd;i++){
if(s[i]=='A'&&checkA(i,cd)){
A.push_back(i);
i+=5;
}
else if(s[i]=='B'&&checkB(i,cd)){
B.push_back(i);
i+=3;
}
}
cda=A.size();
cdb=B.size();
for(int i=0;i<cda;i++){
while(l<cdb&&B[l]<A[i]-K-3)
l++;
while(r<cdb&&B[r]<=A[i]+K+5)
r++;
sum+=r-l;
}
cout<<sum<<endl;
return 0;
}