Pagini recente » Cod sursa (job #1262700) | Cod sursa (job #2897008) | Cod sursa (job #2559559) | Cod sursa (job #1399987) | Cod sursa (job #1368722)
#include <stdio.h>
int val[250001];
int n,m;
int main()
{
freopen ("cuburi2.in","r",stdin);
freopen ("cuburi2.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",&val[i]);
int p1,p2;
int maxim=0;
long long sum=0;
for(int i=1;i<=m;i++)
{
sum=0;
maxim=0;
int ind=0;
scanf("%d%d",&p1,&p2);
for(int j=p1;j<=p2;j++)
{
if(maxim<val[j])
{
maxim=val[j];
ind=j;
}
}
long long sum2=0;
for(int j=p1;j<ind;j++)
{
sum=sum*2+val[j];
}
for(int j=p2;j>ind;j--)
{
sum2=sum2*2+val[j];
}
printf("%d %lld\n",ind,sum+sum2);
}
}