Pagini recente » Cod sursa (job #1577597) | Cod sursa (job #1349151) | Cod sursa (job #1269601) | Cod sursa (job #158234) | Cod sursa (job #2755060)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("kami.in");
ofstream out("kami.out");
int n, v[100002], mx = -1, m;
int operatia1(int x)
{
int total = v[x];
for(int i = x - 1; i > 0; i--)
{
if(total > mx)
return 0;
if(total <= v[i])
return i;
total += v[i];
}
return 0;
}
int main() {
in >> n;
int i;
for(i = 1; i <= n ; i++)
{
in >> v[i];
mx = max(mx,v[i]);
}
in >> m;
int op, val, x;
for(i = 1; i <= m; i++)
{
in >> op;
if(op == 0)
{
in >> x >> val;
v[x] = val;
mx = max (mx, v[x]);
}
else if(op == 1)
{
in >> x;
out << operatia1(x) << '\n';
}
}
return 0;
}