Pagini recente » Borderou de evaluare (job #608314) | Borderou de evaluare (job #2103705) | Cod sursa (job #1942522) | Borderou de evaluare (job #1519692) | Cod sursa (job #254395)
Cod sursa(job #254395)
#include<stdio.h>
#include<math.h>
long i,v[5001],n,m,x,y,j;
void raspuns(int x,int y)
{
long turn,s=0,smax=0,poz;
for(turn=x;turn<=y;turn++)
{
for(i=x;i<=y;i++)
if(i!=turn)
{
if(i<turn)
s=s+((i-turn)*-1)*v[i];
else
s=s+(i-turn)*v[i];
}
if(turn==x)
{
smax=s;
poz=x;
}
if(s<smax)
{
smax=s;
poz=turn;
}
s=0;
}
printf("%ld %ld\n",poz,smax);
}
int main ()
{
freopen("cuburi2.in","r",stdin);
freopen("cuburi2.out","w",stdout);
scanf("%ld%ld",&n,&m);
for(i=1;i<=n;i++)
scanf("%ld",&v[i]);
for(j=1;j<=m;j++)
{
scanf("%ld%ld",&x,&y);
raspuns(x,y);
}
return 0;
}