Educational Codeforces Round 103 (Rated for Div. 2) 总结补题

A

• 题意
  
• 思路-代码

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

//const int N;

void solve()
{
    ll n,k;
    cin>>n>>k;
    if(n==k)
    {
        cout<<1<<endl;
        return;
    }
    else if(n<k)
    {
        ll x=k/n;
        if(k%n)
        x++;
        cout<<x<<endl;
    }
    else
    {
        if(n%k==0)
        {
            cout<<1<<endl;
            return;
        }
        ll x=n/k;
        x++;
        k*=x;
        ll y=k/n;
        if(k%n)
        y++;
        cout<<y<<endl;
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
}

B

• 题意
  **
  **

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N=110;

ll a[N];
void solve()
{
    ll n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    ll sum=0;//leijiahe 
    ll res=0;//daan
    sum+=a[1];
    for(int i=2;i<=n;i++)
    {
        if(100*a[i]<=k*sum)
        {
            sum+=a[i];
            continue;
        }
        else
        {
            ll x=(100*a[i])/k-sum;
            if((100*a[i])%k)
                x++;
            res+=x;
            sum+=(a[i]+x);
        }
    }
    cout<<res<<endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
}

哎，因为马虎wa了一发。

C

• 题意
• 
• 思路
  分情况讨论即可；用一个值存储左边最大值，然后要记得考虑是不是此时闭环或者另外开环（因为这个wa了）
  细节模拟题。模拟题太菜了，说明自己代码能力还没到家。

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 1e5 + 10;

ll c[N], a[N], b[N];
void solve()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> c[i];
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= n; i++)
        cin >> b[i];
    ll sum_l = 0;
    ll res = 0;
    sum_l = abs(a[2]-b[2]) + 1;
    //sum_l=(sum_l+min(a[3],b[3])+c[3-1]-max(a[3],b[3])+1,max(b[3],a[3])-min(a[3],b[3])+1);
    //cout<<sum_l<<endl;
    for (int i = 3; i <= n; i++)
    {
        //res=max(res,sum_l+c[i-1]);
        //cout<<sum_l<<endl;
        if (a[i] == b[i])
        {
            res = max(res, sum_l + c[i - 1]);//直接更新最大值
            sum_l = 1;
        }
        else if ((a[i] == 1 && b[i] == c[i - 1]) || (a[i] == c[i - 1] && b[i] == 1))
        {
            res = max(res, sum_l + c[i - 1]);//是否要闭环，更新最大值
            sum_l = max(sum_l +2, c[i - 1]);//讨论是否要从新的开始
        }
        else
        {
            res=max(res,sum_l+c[i-1]);//更新最大值，考虑直接闭环
            sum_l +=( min(a[i],b[i])+ (c[i-1] - max(b[i],a[i]) + 1));//这个是直接走，不闭环
            sum_l=max(sum_l,max(b[i],a[i])-min(a[i],b[i])+1);//这个是更新一下，看看重新开始是否能变大。
        }
    }
    sum_l += c[n];
    res = max(sum_l, res);
    cout << res << endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
}

其实这样的题，一开始就要把所有的情况考虑清楚，这样的话其实不算太难。

D

• 题意
  

• 代码

#include <bits/stdc++.h>
using namespace std;
int t;
const int N = 3e5+5;
typedef long long LL;
char str[N];
int l[N],r[N];
int main(){
	scanf("%d",&t);
	while(t--){
		int n;
		cin >> n;
		cin >> str+1;
		l[0] = r[n] = 0;
		int cnt = 0;
		for(int i = 1;i <= n;i++){
			if(str[i]!=str[i-1])cnt++;
			else cnt = 1;
			if(str[i]=='L')l[i] = cnt;
			else l[i] = 0;
		}
		cnt = 0;
		for(int i = n;i >= 1;i--){
			if(str[i]!=str[i+1])cnt++;
			else cnt = 1;
			if(str[i]=='R')r[i-1] = cnt;
			else r[i-1] = 0;
		}
		for(int i = 0;i <= n;i++)cout << l[i]+r[i]+1<<" ";
		cout << endl;
	}
	return 0;
}