Pagini recente » Cod sursa (job #2859352) | Cod sursa (job #2777747) | Cod sursa (job #2429990) | Cod sursa (job #2804939) | Cod sursa (job #2146688)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cuburi2.in");
ofstream fout("cuburi2.out");
long long n, m, i, x, y,k,nr,mi;
long long v[250001];
int mij(int x,int y,int mi)
{
nr=0;
for(i=x;i<mi;i++)
nr+=(mi-i+1)*v[i];
for(i=mi;i<y;i++)
nr+=(y-i+1)*v[i];
if(nr>0)return nr;
return 1000000;
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=m;i++)
{
fin>>x>>y;
mi=(x+y)/2;
if((x+y)%2==0)k=mij(x,y,mi);
else k=min(mij(x,y,mi),mij(x,y,mi+1));
fout<<mi<<" "<<k<<endl;
}
return 0;
}