Pagini recente » Cod sursa (job #3200784) | Cod sursa (job #2918603) | Cod sursa (job #813299) | Cod sursa (job #2537016) | Cod sursa (job #3171727)
#include <fstream>
#define limit 1<<17
using namespace std;
long long v[250005], s[250005], ss[250005];
ifstream f("cuburi2.in");
ofstream g("cuburi2.out");
int main()
{
long long n, m, x, y;
f >> n >> m;
for(int i = 1; i <= n; i++)
{
f >> v[i];
s[i] = s[i-1] + v[i];
ss[i] = ss[i-1] + i*v[i];
}
for(int k = 1; k <= m; k++)
{
f >> x >> y;
int st = x, pas = (1 << 17);
while(pas > 0)
{
if(st + pas <= y && 2 * s[st+pas-1] < s[x-1] + s[y])
{
st += pas;
}
pas >>= 1;
}
g << st << " " << ss[y] - ss[st] + st * ((s[st] + s[st - 1]) - (s[x - 1] + s[y])) - (ss[st - 1] - ss[x - 1]) << "\n";
}
}