拐杖糖盛宴

题目链接：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;
}