Pagini recente » Cod sursa (job #1680660) | Cod sursa (job #901117) | Cod sursa (job #787128) | Cod sursa (job #1303199) | Cod sursa (job #1527896)
#include <fstream>
using namespace std;
ifstream fin ("datorii.in");
ofstream fout ("datorii.out");
int A[15001];
struct operatie
{
bool cod;
int a, b;
};
int main()
{
operatie B[100001];
int n, m, suma = 0;
fin>>n>>m;
for (unsigned int i = 1; i <= n; i ++)
fin>>A[i];
for (unsigned int i = 1; i <= m; i ++)
fin>>B[i].cod>>B[i].a>>B[i].b;
for (unsigned i = 1; i <= m; i ++)
{
if (B[i].cod == 0)
A[B[i].a] -= B[i].b;
else
{
unsigned suma = 0;
for (unsigned j = B[i].a; j <= B[i].b; j ++)
suma += A[j];
fout<<suma<<'\n';
}
}
fin.close();
fout.close();
return 0;
}