Pagini recente » Cod sursa (job #1230359) | Cod sursa (job #2565732) | Cod sursa (job #1578098) | Cod sursa (job #1961766) | Cod sursa (job #254468)
Cod sursa(job #254468)
#include <iostream>
#include <fstream>
using namespace std;
int main() {
int n,m,i,mij;
int v[100000],j;
int x,y,dest=0,cost=0;
ifstream f; f.open("cuburi2.in");
ofstream g; g.open("cuburi2.out");
f>>n>>m;
for(i=1; i<=n; i++) {
f>>v[i];
}
if(n%2==1) {
dest=int(n/2)+1;
}
else {
dest=n/2;
}
for(i=1; i<=m; i++) {
f>>x>>y;
cost=0;
if(x>=y) {
mij=x-y;
}
else {
mij=y-x;
}
if(mij%2==1) {
dest=(mij+1)/2 + (x-1);
}
else {
dest=(mij/2)+(x-1);
}
for(j=x; j<=y; j++) {
if(j>dest) {
cost=cost+(j-dest);
}
else if(j<dest) {
cost=cost+(dest-j);
}
}
g<<dest<<" "<<cost<<endl;
}
f.close();
g.close();
return 0;
}