Submission

Score: 30

User: FakeAnutin

Problemset: ความลึก

Language: cpp

Time: 1.097 second

Submitted On: 2026-10-06 14:14:10

#include <bits/stdc++.h>
using namespace std;
int a[1000000];
int arr[1000000];
int main(){
	ios::sync_with_stdio(false); cin.tie(0);
	int n,q; cin>>n>>q;

	arr[0] = 0;
	int ar=0;
	for(int i=1;i<=n;i++){
		int d,l; cin>>d>>l;
		if(d == 1){
		 	for(int j=ar+1;j<=ar+l;j++){
		 		arr[j] = arr[ar] + 1;
		    }
			ar+=l;	
		}
		if(d == -1){
		 	for(int j=ar+1;j<=ar+l;j++){
		 		arr[j] = arr[ar] -1;
		    }
			ar+=l;	
		}
	}
	/*for(int i=1;i<=ar;i++){
		cout<<arr[i];
	}*/
	int mx=0;
	for(int i=1;i<=ar;i++){
		mx = max(arr[i],mx);
	}
	for(int i=1;i<=mx;i++){
		int cc=0;
		for(int j=1;j<=ar;j++){
			if(arr[j] >= i){
				cc++;
				a[i] = max(a[i],cc);
			}else{
				cc=0;
			}
		}
	}
	/*for(int i=1;i<=mx;i++){
		cout<<i<<" = "<<a[i]<<"\n";
	}*/
	int qq[q+5];
	for(int i=1;i<=q;i++){
		cin>>qq[i];
		
	}
	for(int i=1;i<=q;i++){
		int k = qq[i];
		int mp=0,r=mx,ll=1; 
		while(ll<=r){
			int m = (ll+r)/2;
			if(a[m]>=k){
				mp=m;
				ll=m+1;
			}else{
				r=m-1;
			}
		}
	    cout<<mp<<"\n";
	}
}