2021暑假集训-个人赛4

---

A.PizzaForces

传送门
这个题还是挺水的，就是找好之间的关系就好了，不多说了，上代码

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<deque>
#include<map>
#include<set>
#include<cstdio>
#include<vector>
#define ll long long
#define mem(a,b) memset(a,b,sizeof(a))
const ll INF=0x3f3f3f3f;
const ll Max=10000;
using namespace std;
ll i,j,k,t,n,m;
/*queue<ll> q;
stack<ll> s;
//升序队列
priority_queue <int,vector<int>,greater<int> > q;
//降序队列
priority_queue <int,vector<int>,less<int> >q;*/
int main()
{
    scanf("%lld",&t);
    while(t--)
    {
        scanf("%lld",&n);
        ll w=n%6;
        if(n<=6)
            printf("15\n");
        else
        if(w==0)
        printf("%lld\n",n/6*15);
        else if(w>=1&&w<=2)
            printf("%lld\n",(n/6-1)*15+20);
        else if(w==3||w==4)
            printf("%lld\n",(n/6-1)*15+25);
            else if(w==5)
                printf("%lld\n",(n/6+1)*15);

    }
    return 0;
}

B.Two Tables *

传送门

C.Coin Rows *

传送门

D.Say No to Palindromes

传送门

题目大意：给你个字符串长度为n，然后又输入m次操作，把字符串变为不含有任意一个回文串，只有a,b,c 所以最后就6种串的组合,分别为abc,acb,bac,bca,cab,cba，这六种循环组成，所以你需要知道变为这六种的和，然后就退化为前缀和问题，再求区间最小值就行

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<deque>
#include<map>
#include<set>
#include<cstdio>
#include<vector>
#define ll long long
#define mem(a,b) memset(a,b,sizeof(a))
const ll INF=0x3f3f3f3f;
const ll Max=200010;
using namespace std;
char a[Max];
string b[6]={"abc","acb","bac","bca","cab","cba"};
ll sum[6][Max];
ll i,j,k,t,n,m;
/*queue<ll> q;
stack<ll> s;
//升序队列
priority_queue <int,vector<int>,greater<int> > q;
//降序队列
priority_queue <int,vector<int>,less<int> >q;*/
int main()
{
    scanf("%lld%lld",&n,&m);

        scanf("%s",a+1);
        for( i=0;i<6;i++)
	for( j=0;j<n;j++)
	{
		if(b[i][(j+1)%3]==a[j+1])
            sum[i][j+1]=sum[i][j];
        else sum[i][j+1]=sum[i][j]+1;
	}
	while(m--)
	{
		int l,r;
		scanf("%d%d",&l,&r);
		ll ans=n;
		for(i=0;i<6;i++)
		ans=min(ans,sum[i][r]-sum[i][l-1]);
		cout<<ans<<endl;
	}


    return 0;
}

E.Boring Segments *

传送门

F.Good Graph *

传送门