|
摘要：
先排序扫一遍把不需要考虑的土地忽略掉,之后就可以四边形不等式或者斜率优化了.//By YY_More#include<cstdio>#include<algorithm>using namespace std;struct earth{ long long x,y;} p[50010],s[50010];bool cmp(earth a,earth b){ if (a.x==b.x) return a.y<b.y; return a.x<b.x;} long long F[50010];int D[50010],N,top,L,R;inline long l 阅读全文
摘要：
很多斜率优化的论文里都有这道题.//By YY_More#include<cstdio>struct point{ long long x,y;} now,D[1000010];int N,X[1000010],C,L,R;long long sumP[1000010],sumXP[1000010],W[1000010];inline long long xmul(point a,point b,point c){ return (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x);} int main(){ scanf("%d",&a 阅读全文
摘要：
我发现斜率优化的大多都是模板题。//By YY_More#include<cstdio>struct point{ long long x,y;} now,D[50010];int L,R,N,W;long long C[500010];inline long long xmul(point a,point b,point c){ return (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x);} int main(){ scanf("%d%d",&N,&W); for (int i=1;i<=N;i++){ 阅读全文
|
