Cod sursa(job #2474000)
| Utilizator | Data | 14 octombrie 2019 16:38:01 | |
|---|---|---|---|
| Problema | SequenceQuery | Scor | 15 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("sequencequery.in");
ofstream fout("sequencequery.out");
long long n,m,i,p,x,y,sum,a[100001],best[100001];
int main()
{
fin>>n>>m;
for(i=1; i<=n; i++) fin>>a[i];
for(p=1; p<=m; p++)
{
fin>>x>>y;
sum=-1000000000;best[0]=0;
for(i=x; i<=y; i++)
{
best[i]=a[i];
if(best[i-1]+a[i]>a[i]) best[i]=best[i-1]+a[i];
if(best[i]>sum)
{
sum=best[i];
}
best[i-1]=0;
}
fout<<sum<<'\n';
}
return 0;
}
