(easy version)

https://codeforces.com/contest/1196/problem/D1

(hard version)

https://codeforces.com/contest/1196/problem/D2

題解：前綴和|DP

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=200000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,p,l,r,u,v; int ans,cnt,flag,temp,sum; char str[N],s[3][5]={"RGB","GBR","BRG"}; int dp[3][N]; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);scanf("%d",&t);while(t--){scanf("%d%d",&n,&k);scanf("%s",str);ans=0;for(int j=0;j<3;j++)dp[j][k-1]=0;for(int i=0;i<k;i++)for(int j=0;j<3;j++)if(str[i]==s[j][i%3])dp[j][k-1]++,ans=max(ans,dp[j][k-1]);for(int i=k;i<n;i++)for(int j=0;j<3;j++)dp[j][i]=dp[j][i-1]+(str[i]==s[j][i%3])-(str[i-k]==s[j][(i-k)%3]),ans=max(ans,dp[j][i]);cout<<max(0,k-ans)<<endl;}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

?

總結

以上是生活随笔為你收集整理的Codeforces 1196D RGB Substring的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內容還不錯，歡迎將生活随笔推薦給好友。