Cod sursa(job #1017418)
Utilizator | Data | 27 octombrie 2013 19:20:27 | |
---|---|---|---|
Problema | Arbori indexati binar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#define NMax 100005
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
int N,M,X[NMax],S[NMax];
int main()
{
fin>>N>>M;
for(int i=1;i<=N;i++)
{
fin>>X[i];
S[i]=S[i-1]+X[i];
}
while(M--)
{
int op,a,b;
fin>>op>>a>>b;
fout<<S[b]-S[a-1]<<"\n";
}
return 0;
}