u011042985
2016-03-20 02:28求大家帮我看看poj的1723,提交后告诉我答案错误,为什么?我一直没搞懂poj的编译器的规则
#include
#include
using namespace std;
int round(double sum, int num) {
if(sum>0)
return (int)(sum/num + 0.5);
else if(sum == 0) return 0;
else return (int)(sum/num - 0.5);
}
bool isexit(int* x, int y, int num) {
for(int i=0; i<num; i++) {
if(x[i] == y)
return true;
}
return false;
}
int main() {
int num, i=0, var;
int *x;
int *y;
double sum = 0;
cin>>num;
x = (int *) malloc(num * sizeof(int));
y = (int *) malloc(num * sizeof(int));
while(i
cin>>x[i]>>y[i];
sum += y[i++];
}
var = round(sum, num);
sum = 0;
for(i=0; i<num; i++) {
sum += abs(y[i] - var);
}
int xmove, ymove;
for(i=0; i<num; i++) {
for(int j=0; j<num&&j!=i ;j++)
if(x[j]==x[i]) {
xmove = x[j]-1;
while(isexit(x, xmove, num)) {
--xmove;
}
ymove = x[j]+1;
while(isexit(x, ymove, num)) {
++ymove;
}
if(x[j] - xmove > ymove - x[j]) {
sum += abs(ymove - x[j]);
x[j] = ymove;
}
else {
sum += abs(x[j] - xmove);
x[j] = xmove;
}
}
}
cout<<sum<<endl;
free(x);
free(y);
return 0;
}
- 点赞
- 回答
- 收藏
- 复制链接分享
1条回答
为你推荐
- 这段代码有什么作用? .htaccess不断变化
- apache
- php
- 3个回答
- Is It A Tree?
- lines
- it
- numbers
- 结构
- each
- 1个回答
- Friends or Enemies?
- numbers
- lines
- each
- 2个回答
- POJ2352 Stars怎么解线段树
- 1个回答
- POJ2486:Apple Tree(树形DP)
- 1个回答
换一换