Pagini recente » Cod sursa (job #1137153) | Cod sursa (job #232134) | Cod sursa (job #934436) | Cod sursa (job #128348) | Cod sursa (job #1760094)
#include <bits/stdc++.h>
typedef long long var;
const int NMAX = 30005;
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int V[NMAX],SV[NMAX],n;
int Binary(int L,int R,int x){
int MID;
while(L <= R){
if(L == R)
return L;
MID = (L + R) / 2;
if(SV[MID] <= x)
L = MID;
else
R = MID - 1;
}
}
int main()
{
ios :: sync_with_stdio(false);
fin.tie(NULL);
int n,T,p,b;
fin >> n >> T;
for(int i = 1; i <= n; i++){
fin >> V[i];
SV[i] = SV[i - 1] + V[i];
}
for(int i = n + 1,j = 1; i <= 2 * n;j++, i++){
SV[i] = SV[i - 1] + V[j];
}
for(int i = 1; i <= T; i++){
fin >> p >> b;
fout << Binary(p , 2*n , SV[p - 1] + b) - p << "\n";
}
return 0;
}