拐杖糖盛宴

合集 - 蓝桥杯训练(22)

1.路径之谜02-172.3.赢球票02-183.哞叫时间02-184.蛋糕游戏02-195.5.Excel地址02-206.哞叫时间Ⅱ02-207.6.k倍区间02-208.6135.奶牛体检02-219.11. 青蛙跳杯子02-2110.农夫约翰最喜欢的操作02-2211.蓝桥2013·带分数02-23

12.拐杖糖盛宴02-25

13.5438.密病牛02-2614.5439.约翰种地02-2715.5524.多数意见02-2816.炮弹03-0117.5526.细菌平衡03-0418.重复字符串03-0419.5538.回文游戏03-0520.5539.牛奶交换03-0621.5540.最大程度提高生产力03-0722.5590. 沿栅栏散步03-11

收起

题目链接：https://www.acwing.com/problem/content/description/5440/

题意：

给定a，b数组，遍历b数组，按照条件使a数组增加值，求最后的a数组

思路：

模拟

#include<bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define pb push_back
#define endl "\n"
#define fi first
#define se second
#define int long long
//#pragma GCC optimize(3)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int inf=0x3f3f3f3f;
const ll llmax=LLONG_MAX;
const int maxn=2e5+5;
const int mod=1e9+7;
 
int n,m;
int a[maxn];
int b[maxn];
signed main()
{
	ios::sync_with_stdio(false),cin.tie(0);
	cin>>n>>m;
	rep(i,1,n) cin>>a[i];
	rep(i,1,m) cin>>b[i];
	
	rep(i,1,m){
		int s=0;
		int left=b[i];
		for(int j=1;j<=n;j++){
			if(a[j]<=s)continue;
				int pos=a[j];
				if(a[j]>=b[i]){
					a[j]+=left;break;
				}else{
					int dif=a[j]-s;
					a[j]+=dif;
					left-=dif;
					s=pos;
				}
				if(s>=b[i]||left<=0)break;
		}
	}
	rep(i,1,n) cout<<a[i]<<endl;
	return 0;
}