Cod sursa(job #2121104)
| Utilizator | Data | 3 februarie 2018 12:00:02 | |
|---|---|---|---|
| Problema | SequenceQuery | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <iostream>
using namespace std;
int v[100001];
int searchmaxx(int x,int y)
{
int i,maxx=0,s=0;
for(i=x;i<=y;i++)
{
s+=v[i];
if(s>maxx) maxx=s;
if(s<0)
{
s=0;
}
}
return s;
}
int main()
{
int n,i,x,k,a,y;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
}
for(a=1;a<=k;a++)
{
cin>>x>>y;
cout<<searchmaxx(x,y)<<"\n";
}
return 0;
}
