Cod sursa(job #254757)
Utilizator | Data | 7 februarie 2009 13:59:06 | |
---|---|---|---|
Problema | Cuburi2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Stelele Informaticii 2009, clasele 9-10, ziua 2 | Marime | 1.06 kb |
#include<fstream>
using namespace std;
ifstream f("cuburi2.in");
ofstream g("cuburi2.out");
int main()
{
unsigned long int m,n,v[250000],k=0;
int i,max=0,x,y,poz=0;
f>>n>>m;
for(i=1;i<=n;i++) f>>v[i];
for(i=1;i<=m;i++) {
max=0;
poz=0;
k=0;
f>>x>>y;
for(i=x;i<=y;i++)
{
if(v[i]>max) { max=v[i]; poz=i;}
}
for(i=x;i<=y;i++)
{
if(i>poz) k+=(v[i]*(i-poz));
if(i<poz) k+=(v[i]*(poz-i));
if(i==poz)k+=0;
}
g<<max<<" "<<k<<endl;}
f.close();
g.close();
return 0;
}