Pagini recente » Cod sursa (job #2348834) | Cod sursa (job #3127900) | Cod sursa (job #1798838) | Cod sursa (job #2681847) | Cod sursa (job #2056986)
#include <iostream>
#include <fstream>
using namespace std;
int n, m, q, a, b, l, r, mid, sp[100002], i, j;
int main()
{
ifstream fin ("aib.in");
ofstream fout ("aib.out");
fin >> n >> m;
for(i = 1; i <= n; i++)
{
fin >> sp[i];
sp[i] += sp[i - 1];
}
for(i = 1; i <= m; i++)
{
fin >> q;
if(q == 0)
{
fin >> a >> b;
for(j = a; j <= n; j++)
sp[j] += b;
}
else if(q == 1)
{
fin >> a >> b;
fout << sp[b] - sp[a - 1] << "\n";
}
else if(q == 2)
{
fin >> a;
l = 1;
r = n;
while(l < r)
{
mid = (l + r) / 2;
if(sp[mid] < a)
l = mid + 1;
else
r = mid;
}
if(sp[l] == a)
fout << l << "\n";
else
fout << "-1\n";
}
}
return 0;
}