Original link: https://www.shuizilong.com/house/archives/luogu-p3337-zjoi2013-%E9%98%B2%E5%AE%88%E6%88%98%E7%BA%BF/
- https://www.luogu.com.cn/problem/P3337
- https://darkbzoj.cc/problem/3112
- https://blog.bill.moe/ZJOI2013-defend/
const int N = int(1e3) + 9, M = int(1e4) + 9; struct Simplex { DB a[N+1][M+1]; int n, m; void pivot(int in, int out) { REP(i, m+1) if(i!=in) a[out][i] /= -a[out][in]; //reset out constraint a[out][in] = 1/a [out][in]; REP(i, n+1) if (i!=out && sgn(a[i][in])) { //Recalculate other constraints DB t = a[i][in]; a[i][in ] = 0; REP(j, m+1) a[i][j] += t*a[out][j]; } } DB run() { while (true) { int in=0, out=0; DB Min=OO; REP_1(i, m) if(sgn(a[0][i])>0) { in=i; break; } if(!in)return a[0][0]; REP_1(i, n) if(sgn(a[i][in])<0&&a[i][0]/-a[i][in]<Min) { Min=a[i][0]/-a[i][in]; out=i; } if(!out)throw ; //unbounded pivot(in, out); } } int gao() { // zb // c A RD(n, m); REP_1(i, n) RD(a[i][0]); REP_1(i, m) { int l, r; RD(l, r); RD(a[0][i]); FOR_1(j, l, r) a[j][i] -= 1; } return run(); } } fst; int main() { #ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout); #endif OT(fst.gao()); }
This article is reprinted from: https://www.shuizilong.com/house/archives/luogu-p3337-zjoi2013-%E9%98%B2%E5%AE%88%E6%88%98%E7%BA%BF/
This site is for inclusion only, and the copyright belongs to the original author.