Pagini recente » Atasamentele paginii jc2025rd1 | Cod sursa (job #3316712) | Cod sursa (job #1809890) | Cod sursa (job #2136545) | Cod sursa (job #3341329)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
int v[100010];
long long int suma, pmin;
int n, m, a,b,op;
void qp(int xx, int st, int dr )
{
suma=0;
pmin=-1;
if(st>dr) return;
bool gasit=false;
int mij=(st+dr)/2;
suma = 0;
for (int i = mij; i > 0; i-=(i&-i))
suma += v[i];
if(suma==xx)
gasit=true, pmin=mij;
else if(suma>xx) qp(xx,st,mij-1);
else qp(xx,mij+1,dr);
}
void query(int y)
{
suma = 0;
for (int i = y; i >0; i -= (i & -i))
suma += v[i];
}
void update(int p, int x)
{
for (int i = p; i <= n; i += (i & -i))
v[i] += x;
}
int main()
{
fin >> n >> m;
/// for (int i = 0; i <= n; i++) v.push_back(0);
for (int i = 1; i <= n; i++)
{
fin >> a;
update(i, a);
}
for (int i = 1; i <= m; i++)
{
fin >> op;
if (op == 0)
{
fin >> a >> b;
update(a, b);
}
if (op == 1)
{
fin >> a >> b;
query(b);
int s1=suma;
query(a-1);
s1 -= suma;
fout << s1 << endl;
}
if (op == 2)
{ fin >> a;
qp(a,1,n);
fout << pmin<<endl;
}
}
}