Pagini recente » Cod sursa (job #2135042) | Istoria paginii utilizator/penis_valoare | Cod sursa (job #796581) | Cod sursa (job #2257574) | Cod sursa (job #767628)
Cod sursa(job #767628)
#include <fstream>
using namespace std;
ifstream fin("sequencequery.in");
ofstream fout("sequencequery.out");
//void citire ( int &,int &);
void ssm (int ,int );
int max ( int ,int );
int v[100000];
int main()
{
int n,k,i,x,y;
//citire(n,k);
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=0;i<k;i++)
{
fin>>x>>y;
ssm (x,y);
}
return 0;
}
void ssm ( int a, int b)
{
int i,best[3],maxim;
best[a%2]=v[a];
maxim=v[a];
for (i=a+1;i<=b;i++)
{
best[i%2]=max(v[i],best[!(i%2)]+v[i]);
if(best[i%2]>maxim)
maxim=best[i%2];
}
fout<<maxim<<"\n";
}
int max ( int a,int b)
{
if (a>b)
return a;
return b;
}