大致思路:
O(1),手动计算,数学题,分四个边算出公式,代值即可。
代码如下:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,x,y;
int main(){
scanf("%d%d%d",&n,&x,&y);
int ans;
if((x<=n/2)&&(y>=x&&y<=(n-x+1))){
ans=2*(x-1)*(2*n-2*x+1)+n-(n-x+1-y);
}else if((x>n/2)&&(y>=(n-x+1)&&y<=x)){
ans=2*(x-1)*(2*n-2*x+1)+n+(n-x+1-y);
}else if((y<=n/2+1)&&(x>=y&&x<=(n-y+1))){
ans=(2*y-1)*(2*n-2*y)+2*n-2*y-(x-y-1);
}else{
ans=2*(n-y)*(2*y-1)+n+n-2*(n-y)-1-(y-x);
}
printf("%d",ans);
return 0;
}