Pagini recente » Cod sursa (job #2621856) | Cod sursa (job #782684) | Cod sursa (job #183653) | Cod sursa (job #2754041) | Cod sursa (job #1796997)
#include<fstream>
using namespace std;
class InputReader {
public:
InputReader() {}
InputReader(const char *file_name) {
input_file = fopen(file_name, "r");
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
inline InputReader &operator >>(int &n) {
while(buffer[cursor] < '0' || buffer[cursor] > '9') {
advance();
}
n = 0;
while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
n = n * 10 + buffer[cursor] - '0';
advance();
}
return *this;
}
private:
FILE *input_file;
static const int SIZE = 1 << 17;
int cursor;
char buffer[SIZE];
inline void advance() {
++ cursor;
if(cursor == SIZE) {
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
}
}f("cuburi2.in");
ofstream g("cuburi2.out");
int i,j,n,m,step,x,y,a[1<<18];
long long s[1<<18],sd[1<<18],ss[1<<18];
int main()
{
f>>n>>m;
for(i=1;i<=n;++i)
f>>a[i],s[i]=s[i-1]+a[i],ss[i]=ss[i-1]+s[i-1];
for(i=n;i;--i)
sd[i]=sd[i+1]+s[n]-s[i];
for(i=1;i<=m;++i)
{
f>>x>>y;
step=1<<17;
for(j=x;step;step>>=1)
if(j+step<=y&&s[j+step-1]-s[x-1]<s[y]-s[j+step-1]) j+=step;
g<<j<<' '<<ss[j]-ss[x]-s[x-1]*(j-x)+sd[j]-sd[y]-(s[n]-s[y])*(y-j)<<'\n';
}
return 0;
}