Pagini recente » Cod sursa (job #264578) | Cod sursa (job #1171315) | Cod sursa (job #1769374) | Cod sursa (job #3284483) | Cod sursa (job #960652)
Cod sursa(job #960652)
#include<fstream>
using namespace std;
ifstream f("sequencequery.in");
ofstream g("sequencequery.out");
int n,m;
int i,j,k,x,y;
int bestsum;
int best[100001],a[100001];
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
for(k=1;k<=m;k++)
{
f>>x>>y;
bestsum=a[x];
for(i=x+1;i<=y;i++)
{
best[i]=a[i];
if(best[i]<best[i-1]+a[i])
best[i]=best[i-1]+a[i];
if(bestsum<best[i])
bestsum=best[i];
}
g<<bestsum<<"\n";
for(i=x;i<=y;i++)
best[i]=0;
}
return 0;
}