Submission

Score: 100

User: FakeAnutin

Problemset: ความลึก

Language: cpp

Time: 0.432 second

Submitted On: 2026-10-06 15:45:26

#include <bits/stdc++.h>
using namespace std;
int a[1000000];
int mx[1000000];
int main(){
	int n,q; cin>>n>>q;
	int ar=0,t=0;
	for(int i=1;i<=n;i++){
		int x,y;
		cin>>x>>y;
		if(x==1){
			ar++;
			a[ar]=t;
		}else{
			mx[ar] = max(mx[ar],t-a[ar]);
			ar--;
		}
		t+=y;
	}
	while(ar > 0){
		mx[ar] = max(mx[ar],t-a[ar]);
		ar--;
	}
	int cc=0;
	int ii=1;
	while(mx[ii] != 0){
		//cout<<mx[ii];
		cc++;
		ii++;
	}
	int qq[q+5];
	for(int i=1;i<=q;i++){
		cin>>qq[i];
	}
	for(int i=1;i<=q;i++){
		int mxx=0;
		for(int j=cc;j>=1;j--){
			if(qq[i] <= mx[j]){
				mxx=j;
				break;
			}
		}
		cout<<mxx<<"\n";
	}
}