牛客寒训营3 I(尺取或二分，做麻烦了)

题目
题意: 给定一个字符串，求所有长度在[L,R]之间满足条件的字符串。条件为:四个类别的字符中至少有三个。①小写字母②大写字母③数字④特殊字符
思路: 我总结对于每个位置去二分最右边的合法位置，统计满足长度的贡献。因为维护了四个类型的前缀和，这样是O(nlogn)的。
 但是看了一手题解，发现可以O(n)。不需要维护四个类型的前缀和，直接开长度为4的数组就能维护每个类型字母最右边的位置。然后sort一下就可以找到最右边的合法位置。O(n * 4 log(4)),O(n).
时间复杂度: O(n)
代码:

赛时代码

// Problem: 智乃的密码
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/23478/I
// Memory Limit: 524288 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<complex>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<list>
#include<set>
#include<queue>
#include<stack>
#define OldTomato ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define fir(i,a,b) for(int i=a;i<=b;++i) 
#define mem(a,x) memset(a,x,sizeof(a))
#define p_ priority_queue
// round() 四舍五入 ceil() 向上取整 floor() 向下取整
// lower_bound(a.begin(),a.end(),tmp,greater<ll>()) 第一个小于等于的
// #define int long long //QAQ
using namespace std;
typedef complex<double> CP;
typedef pair<int,int> PII;
typedef long long ll;
// typedef __int128 it;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const int N = 1e5+10;
const int M = 1e6+10;
const int mod = 1e9+7;
const double eps = 1e-6;
inline int lowbit(int x){ return x&(-x);}
template<typename T>void write(T x)
{
    if(x<0)
    {
        putchar('-');
        x=-x;
    }
    if(x>9)
    {
        write(x/10);
    }
    putchar(x%10+'0');
}
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
int n,m,k,T;
int L,R;
char s[N];
int cnt[5][N]; //大写、小写、数字、特殊字符
void solve()
{
   read(n); read(L); read(R);
   scanf("%s",s+1);
   for(int i=1;i<=n;++i)
   {
   	  for(int j=1;j<5;++j) cnt[j][i] = cnt[j][i-1];
   	  if(s[i] >= 'A' && s[i] <= 'Z') cnt[1][i] ++ ;
   	  else if(s[i] >= 'a' && s[i] <= 'z') cnt[2][i] ++ ;
   	  else if(s[i] >= '0' && s[i] <= '9') cnt[3][i] ++ ;
   	  else cnt[4][i] ++ ;
   }
   ll ans = 0;
   for(int i=1;i+L-1<=n;++i)
   {
   	  int idx1,idx2,idx3,idx4;
   	  idx1 = lower_bound(cnt[1]+1,cnt[1]+n+1,cnt[1][i-1]+1) - (cnt[1]);
   	  idx2 = lower_bound(cnt[2]+1,cnt[2]+n+1,cnt[2][i-1]+1) - (cnt[2]);
   	  idx3 = lower_bound(cnt[3]+1,cnt[3]+n+1,cnt[3][i-1]+1) - (cnt[3]);
   	  idx4 = lower_bound(cnt[4]+1,cnt[4]+n+1,cnt[4][i-1]+1) - (cnt[4]);
   	  // cout<<i<<":"<<idx1<<" "<<idx2<<" "<<idx3<<" "<<idx4<<endl;
   	  
   	  //1 2 3
   	  int r1 = max({idx1,idx2,idx3}),r2 = max({idx1,idx2,idx4}),r3 = max({idx2,idx3,idx4});int r4 = max({idx1,idx3,idx4});
   	  int r = min({r1,r2,r3,r4});
   	  // cout<<i<<":"<<r<<"?"<<endl;
   	  if(r != n+1)
   	  {
   	  	int len1 = r - i + 1;
   	  	int len2 = len1 + n - r;
   	  	// cout<<i<<":"<<len1<<" "<<len2<<"?"<<endl;
   	  	if(len1 <= L)
   	  	{
   	  	   ans += min(len2,R) - L + 1;
   	  	}
   	  	else if(len1 <= R)
   	  	{
   	  	   ans += min(len2,R) - len1 + 1;
   	  	}
   	  }
   	  // else break;
   }
   write(ans);
}
signed main(void)
{  
   T = 1;
   // OldTomato; cin>>T;
   // read(T);
   while(T--)
   {
   	 solve();
   }
   return 0;
}

O(n)

// Problem: 智乃的密码
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/23478/I
// Memory Limit: 524288 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<complex>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<list>
#include<set>
#include<queue>
#include<stack>
#define OldTomato ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define fir(i,a,b) for(int i=a;i<=b;++i) 
#define mem(a,x) memset(a,x,sizeof(a))
#define p_ priority_queue
// round() 四舍五入 ceil() 向上取整 floor() 向下取整
// lower_bound(a.begin(),a.end(),tmp,greater<ll>()) 第一个小于等于的
// #define int long long //QAQ
using namespace std;
typedef complex<double> CP;
typedef pair<int,int> PII;
typedef long long ll;
// typedef __int128 it;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const int N = 1e5+10;
const int M = 1e6+10;
const int mod = 1e9+7;
const double eps = 1e-6;
inline int lowbit(int x){ return x&(-x);}
template<typename T>void write(T x)
{
    if(x<0)
    {
        putchar('-');
        x=-x;
    }
    if(x>9)
    {
        write(x/10);
    }
    putchar(x%10+'0');
}
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
int n,m,k,T;
int L,R;
char s[N];
int p[5];
int get(char ch)
{
	if(ch >= '0' && ch <= '9') return 0;
	if(ch >= 'a' && ch <= 'z') return 1;
	if(ch >= 'A' && ch <= 'Z') return 2;
	return 3;
}
void solve()
{
   read(n); read(L); read(R);
   scanf("%s",s+1);
   ll ans = 0;
   for(int i=1;i<=n;++i)
   {
   	 p[get(s[i])] = i;
   	 vector<int> va;
   	 for(int j=0;j<4;++j) va.push_back(p[j]);
   	 sort(va.begin(),va.end()); //最小的合法位置
   	 int st = max(1,i - R + 1); //最靠左合法位置
   	 int ed = min(va[1],i - L + 1); //合法位置
   	 // cout<<i<<":"<<st<<" "<<ed<<"?"<<endl;
   	 ans += max(0,ed - st + 1);
   }
   write(ans);
}
signed main(void)
{  
   T = 1;
   // OldTomato; cin>>T;
   // read(T);
   while(T--)
   {
   	 solve();
   }
   return 0;
}