Pagini recente » Cod sursa (job #1140404) | Cod sursa (job #32036) | Cod sursa (job #2227160) | Cod sursa (job #2713148) | Cod sursa (job #1666275)
#include <fstream>
using namespace std;
ifstream f("cuburi2.in");
ofstream g("cuburi2.out");
int n,m,i,sol,p,u,mij,sum,x,y,st[250001],dr[250001],v[250001];
int main()
{
f >> n >> m;
f >> v[1];
st[1] = v[1];
for(i = 2; i <= n; ++i)
{
f >> v[i];
v[i] += v[i - 1];
st[i] = v[i] + st[i - 1];
}
for(i = n; i >= 1; --i)
dr[i] = v[n] - v[i - 1] + dr[i + 1];
for(i = 1; i <= m; ++i)
{
f >> x >> y;
p = x;
u = y;
while(p <= u)
{
mij = (p + u) / 2;
if(v[mij] - v[x - 1] > v[y] - v[mij])
{
sol = mij;
u = mij - 1;
}
else
p = mij + 1;
}
g << sol << " ";
sum = st[sol - 1] - st[x - 1] - (v[x - 1] * (sol - x));
sum += dr[sol + 1] - dr[y + 1] - (v[n] - v[y]) * (y - sol);
g << sum << '\n';
}
return 0;
}