暑假刷题第二天--7/10

最新推荐文章于 2024-09-12 13:19:42 发布

不能AC的小菜鸡

最新推荐文章于 2024-09-12 13:19:42 发布

阅读量99

点赞数

分类专栏：暑假打卡文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/weixin_74139128/article/details/131639744

版权

暑假打卡专栏收录该内容

27 篇文章 2 订阅

订阅专栏

本文包含三道编程竞赛题目，分别来自Codeforces的EducationalCodeforcesRound151（Div.2）和ACWing题库。第一题涉及字符串处理，判断是否能在给定限制下完成操作。第二题是关于序列和的计算，寻找最大子序列和。第三题是高精度计算问题，解决国王游戏中的乘法和除法操作。所有题目均使用C++语言解答，涉及算法和数据结构的应用。

摘要由CSDN通过智能技术生成

Status - Educational Codeforces Round 151 (Rated for Div. 2) - Codeforces

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
void solve(){
	int m;
	string s,l,r;
	cin>>s>>m>>l>>r;
	int n=s.size();
	int t=-1;
	for(int i=0;i<m;i++){
		int temp=0,k=t+1;
		for(char j=l[i];j<=r[i];j++){
			k=t+1;
			while(s[k]!=j&&k<n){
				k++;
			}
			temp=max(k,temp);
		}
		t=max(temp,k);
	}
	if(t>=n)cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
}
int main(){
	int t;
	cin>>t;
	while(t--){
		solve();
	}
}

Problem - D - Codeforces

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
void solve(){
	int n;
	cin>>n;
	vector<long long> a(n + 1),sum(n + 1);
	for(int i = 1;i <= n;i++)   cin >> a[i],sum[i] = sum[i - 1] + a[i];
	long long res = 0,flag = 0,premax = 0;
	for(int i = 1;i <= n;i++)
         {
             if(sum[i] - premax < flag)
             {
                 flag = sum[i] - premax;
                 res = premax;
             }
             premax = max(premax,sum[i]);
         }
          cout << res << "\n";
}
int main(){
	int t;
	cin>>t;
	while(t--){
		solve();
	}
}

4740. 跑圈 - AcWing题库

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
long long cnt=0;
void solve(){
	long long n,k;
	cnt++;
	cin>>n>>k;
	long long ans=0,sum=0;
	int f=1;
	for(int i=0;i<k;i++){
		long long q;
		char s;
		cin>>q>>s;
		if(s=='C')sum+=q;
		else sum-=q;
		ans+=abs(sum)/n;
		sum=sum%n;
	}
	printf("Case #%lld: %lld\n",cnt,ans);
}
int main(){
	int t;
	cin>>t;
	while(t--){
		solve();
	}
}

114. 国王游戏 - AcWing题库（贪心+高精度）

#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

typedef pair<int, int> PII;
const int N = 1010;

int n;
PII p[N];

vector<int> mul(vector<int>a, int b)
{
    vector<int> c;
    int t = 0;
    for (int i = 0; i < a.size(); i ++ )
    {
        t += a[i] * b;
        c.push_back(t % 10);
        t /= 10;
    }
    while (t)
    {
        c.push_back(t % 10);
        t /= 10;
    }
    return c;
}

vector<int> div(vector<int>a, int b)
{
    vector<int> c;
    bool is_first = true;
    for (int i = a.size() - 1, t = 0; i >= 0; i -- )
    {
        t = t * 10 + a[i];
        int x = t / b;
        if (!is_first || x)
        {
            is_first = false;
            c.push_back(x);
        }
        t %= b;
    }
    reverse(c.begin(), c.end());
    return c;
}

vector<int> max_vec(vector<int> a, vector<int> b)
{
    if (a.size() > b.size()) return a;
    if (a.size() < b.size()) return b;
    if (vector<int>(a.rbegin(), a.rend()) > vector<int>(b.rbegin(), b.rend())) return a;
    return b;
}

int main()
{
    cin >> n;
    for (int i = 0; i <= n; i ++ )
    {
        int a, b;
        cin >> a >> b;
        p[i] = {a * b, a};
    }
    sort(p + 1, p + n + 1);

    vector<int> product(1, 1);

    vector<int> res(1, 0);
    for (int i = 0; i <= n; i ++ )
    {
        if (i) res = max_vec(res, div(product, p[i].first / p[i].second));
        product = mul(product, p[i].second);
    }

    for (int i = res.size() - 1; i >= 0; i -- ) cout << res[i];
    cout << endl;

    return 0;
}