1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<complex>
#include<cstdlib>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define mid (x+y>>1)
#define sqr(x) ((x)*(x))
#define NM 200005
#define nm 100005
const double pi=acos(-1);
const ll inf=5e18;
using namespace std;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
struct P{
ll x,y;
bool operator<(const P&o)const{return x<o.x;}
}a[NM];
int n,q[NM],qh,qt;
ll b[NM],c[NM],ans;
double slope(int x,int y){
return 1.0*(b[x-1]-b[y-1])/(a[x].x-a[y].x)+a[x].x+a[y].x;
}
int main(){
n=read();inc(i,1,n)a[i].x=read(),a[i].y=read();
sort(a+1,a+1+n);
inc(i,1,n)b[i]=b[i-1]+(a[i].y<0?-a[i].y:0);
dec(i,n,1)c[i]=c[i+1]+(a[i].y>0?a[i].y:0);
ans=inf;
qh=0;qt=-1;
inc(i,1,n){
while(qh<qt&&slope(q[qt-1],q[qt])>slope(q[qt-1],i))qt--;
q[++qt]=i;
while(qh<qt&&slope(q[qh],q[qh+1])<2*a[i].x)qh++;
ans=min(ans,b[q[qh]-1]+sqr(a[q[qh]].x-a[i].x)+c[i+1]);
}
return 0*printf("%lld\n",ans);
}
|
