Pagini recente » Cod sursa (job #187922) | Cod sursa (job #2553020) | Cod sursa (job #1780280) | Cod sursa (job #3272691) | Cod sursa (job #1679337)
#include <iostream>
#include <fstream>
using namespace std;
ofstream g("sequencequery.out");
ifstream f("sequencequery.in");
int main()
{
long v[100005];
long long int n, m, i, j, S, a, b, bestSum=-1000000000000, sum=0, be, en, idx;
f>>n>>m;
for (i=0;i<n;i++)
f>>v[i];
for (i=0;i<m;i++)
{
sum=0;
bestSum=-1000000000000;
f>>a>>b;
for (j=a;j<=b;j++)
{
if (sum<0)
sum=S, idx=i;
else
sum=sum+S;
if (bestSum<sum)
bestSum=sum, be=idx, en=i;
}
g<<bestSum<<'\n';
}
return 0;
}