Cod sursa(job #1249113)
| Utilizator | Data | 26 octombrie 2014 15:42:45 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define Maxim 15010
ifstream f("datorii.in");
ofstream g("datorii.out");
long a[Maxim],i,n,m,t,v,z;
int scd(int x, int y)
{
if(x < y) return a[x] + scd(x+1,y);
else return a[y];
}
void update(int k, int l)
{
a[k]-=l;
}
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
{
f>>a[i];
}
for(i=1;i<=m;i++)
{
f>>z>>t>>v;
switch(z)
{
case 0:
update(t,v);
break;
case 1:
g<<scd(t,v)<<'\n';
break;
}
}
return 0;
}
