Pagini recente » Istoria paginii moisil-2016/solutii | Cod sursa (job #2488591) | Cod sursa (job #1297628) | Ciurul lui Erathostene | Cod sursa (job #264880)
Cod sursa(job #264880)
#include <fstream.h>
ifstream f("cuburi2.in");
ofstream g("cuburi2.out");
int main()
{
long int n,m,x,y,i,j,max=0,tur=1;
char b[250001],a[250001];
long long s;
f>>n>>m;
for(i=1;i<=n;i++) f>>a[i];
for(j=1;j<=m;j++)
{f>>x>>y;
max=0;
for(i=x;i<=y;i++)
{b[i]=a[i];
if(max<a[i]) {max=a[i];tur=i;}
}s=0;
for(i=x;i<=y;i++)
{
if(b[i]!=max)
{if(tur>i) s=s+(tur-i)*b[i];
if(tur<i) s=s+(i-tur)*b[i];}
}
g<<tur<<" "<<s<<"\n"; }
return 0;
}