Cod sursa(job #1887592)
Utilizator | Data | 21 februarie 2017 17:57:27 | |
---|---|---|---|
Problema | Datorii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream fi("datorii.in");
ofstream fo("datorii.out");
int S[15005],n,m;
int main()
{
int i,tip,T,V,P,Q,s;
fi>>n>>m;
for(i=1; i<=n; i++)
fi>>S[i];
while(m!=0)
{
fi>>tip;
if(tip==0)
{
fi>>T>>P;
S[T]=S[T]-P;
}
else
{
fi>>P>>Q;
s=0;
for(i=P; i<=Q; i++)
s=s+S[i];
fo<<s<<"\n";
}
m--;
}
fi.close();
fo.close();
}