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
| #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define maxn 1205
#define put() putchar('\n')
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
using namespace std;
Tp void read(T &x){
int f=1;x=0;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
x*=f;
}
namespace Debug{
Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
int power(int x,int y=mod-2) {
int sum=1;
while (y) {
if (y&1) sum=sum*x%mod;
x=x*x%mod;y>>=1;
}
return sum;
}
int n,m;
struct yyy {
int x,y,z;
yyy operator -(const yyy tmp) const {
return {x-tmp.x,y-tmp.y,0};
}
}a[maxn],b[10005];
int f[maxn][maxn],c[maxn],d[maxn],sum,ans=-1e9;
int cross(yyy x,yyy y) {return x.x*y.y-x.y*y.x;}
signed main(void){
int i,j,k,l,r,mid;
read(n);
for (i=1;i<=n;i++) read(a[i].x),read(a[i].y),a[i+n]=a[i];
read(m);
for (i=1;i<=m;i++) {
read(b[i].x),read(b[i].y),read(b[i].z);sum+=b[i].z;
}
for (i=1;i<=n;i++) {
for (j=1;j<=2*n;j++) d[j]=0;
for (j=1;j<=m;j++) {
l=i,r=i+n;
while (l+1<r) {
mid=l+r>>1;
if (cross(b[j]-a[i],a[mid]-a[i])<0) r=mid;
else l=mid;
}
d[r]+=b[j].z;d[i+n]-=b[j].z;
}
for (j=1;j<=2*n;j++) d[j]+=d[j-1];
for (j=1;j<=n;j++) f[i][j]=d[j]+d[j+n];
}
for (i=1;i<=n;i++) for (j=i+1;j<=n;j++) for (k=j+1;k<=n;k++) {
ans=max(ans,sum-f[i][j]-f[j][k]-f[k][i]);
}
printf("%d\n",ans);
return 0;
}
|