提出 #14775983

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define 	pb	push_back 
#define 	ff	first 
#define 	ss	second 
using namespace std;
typedef long long ll;
inline void debug() {
	#ifndef ONLINE_JUDGE 
	freopen("input.txt", "r", stdin); 
	freopen("output.txt", "w", stdout);
	#endif
	}
ll const u_bound=4*(1e7)+7LL;
int main(){
	ll n,m,k;
	cin>>n>>m>>k;
	ll arr[n+m];
	for(int i=0;i<n+m;i++)
		cin>>arr[i];
	reverse(arr,arr+n);
		ll low=	0;
		ll high=u_bound;
		ll mid;
	while(low<high){
		
		mid=low+(ll)(high-low+1LL)/2LL;
		//cout<<low<<" "<<high<<" "<<mid<<"\n";
		bool f=0;
		if(mid<=n+m){
		queue<ll>s;
		ll sum=0;
		for(int i=0;i<mid;i++){
			s.push(arr[i]);
			sum+=arr[i];
		}
		for(int i=mid;i<n+m;i++){
			if(sum<=k){
				f=1;
				break;
			}else{
				sum-=s.front();
				s.pop();
				sum+=arr[i];
				s.push(arr[i]);
			}
		}
		if(sum<=k)
				f=1;
		}
		if(f==0)
			high=mid-1;
		else
			low=mid;
		
	}
	if(low<0)
		low=0;
	cout<<low;





}

提出情報

ジャッジ結果