Pagini recente » Cod sursa (job #486248) | Cod sursa (job #826727) | Cod sursa (job #1830638) | Cod sursa (job #2979433) | Cod sursa (job #254640)
Cod sursa(job #254640)
#include<fstream.h>
int n,m,a[5000][5000],vect[5000],i,j,s,min,x,y,k;
int modul(int k,int p)
{
if(k-p<0)
return -(k-p);
else
return (k-p);
}
int main()
{
ifstream f("cuburi2.in");
ofstream g("cuburi2.out");
f>>n>>m;
for(i=1;i<=n;i++)
f>>vect[i];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i==j)
a[i][j]=vect[j];
else
a[i][j]=vect[j]*modul(j,i);
for(i=1;i<=n;i++)
{
s=0;
for(j=1;j<=n;j++)
if(i==j)
a[i][j]=0;
else
{
s+=a[i][j];
a[i][j]=s;
}
}
for(i=1;i<=m;i++)
{
f>>x>>y;
min=100000;
for(j=x;j<=y;j++)
if(a[j][y]-a[j][x-1]<min&&j!=y)
{
min=a[j][y]-a[j][x-1];
k=j;
}
else
if(a[j][y-1]-a[j][x-1]<min&&j==y)
{
min=a[j][y-1]-a[j][x-1];
k=j;
}
g<<k<<" "<<min<<"\n";
}
return 0;
}