Cod sursa(job #1514230)
Utilizator | Dragan Andrei AndreiD31 | Data | 30 octombrie 2015 20:59:59 |
---|---|---|---|
Problema | SequenceQuery | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int a[1000001],b[1000001],m,p1,t,p2,st,j,poz,dr,i,smax=0,max1,n;
int main()
{ifstream f("sequencequery.in");
ofstream g("sequencequery.out");
f>>n>>m;
for(i=1;i<=n;i++)f>>a[i];
for(i=1;i<=m;i++)
{f>>p1>>p2;
for(j=p1;j<=p2;j++)
b[j]=a[j];
for(j=p1+1;j<=p2;j++)
{b[j]=a[j];
if(b[j-1]+a[j]>a[j])b[j]=b[j-1]+a[j];
}
g<<b[p2]<<'\n';
}
return 0;
}