{"id":1975,"date":"2022-07-03T22:39:48","date_gmt":"2022-07-03T14:39:48","guid":{"rendered":"https:\/\/www.shuizilong.com\/house\/?p=1975"},"modified":"2022-07-07T10:01:35","modified_gmt":"2022-07-07T02:01:35","slug":"%e7%ba%bf%e6%80%a7%e8%a7%84%e5%88%92","status":"publish","type":"post","link":"https:\/\/www.shuizilong.com\/house\/archives\/%e7%ba%bf%e6%80%a7%e8%a7%84%e5%88%92\/","title":{"rendered":"\u7ebf\u6027\u89c4\u5212"},"content":{"rendered":"<h2>\u8d44\u6599<\/h2>\n<ul>\n<li><a href=\"https:\/\/oi-wiki.org\/math\/simplex\/\">https:\/\/oi-wiki.org\/math\/simplex\/<\/a><\/li>\n<li><a href=\"https:\/\/blog.bill.moe\/simplex-algorithm-notes\/\">https:\/\/blog.bill.moe\/simplex-algorithm-notes\/<\/a><\/li>\n<li><a href=\"https:\/\/notes.sshwy.name\/Math\/Linear-Algbra\/LP-and-its-Dual\/\">https:\/\/notes.sshwy.name\/Math\/Linear-Algbra\/LP-and-its-Dual\/<\/a><\/li>\n<li><a href=\"https:\/\/www.zybuluo.com\/winee\/note\/1186606\">https:\/\/www.zybuluo.com\/winee\/note\/1186606<\/a><\/li>\n<li><a href=\"https:\/\/en.wikipedia.org\/wiki\/Simplex_algorithm\">https:\/\/en.wikipedia.org\/wiki\/Simplex_algorithm<\/a><\/li>\n<li><a href=\"https:\/\/en.wikipedia.org\/wiki\/Ellipsoid_method\">https:\/\/en.wikipedia.org\/wiki\/Ellipsoid_method<\/a><\/li>\n<li><a href=\"https:\/\/en.wikipedia.org\/wiki\/Interior-point_method\">https:\/\/en.wikipedia.org\/wiki\/Interior-point_method<\/a><\/li>\n<li><a href=\"https:\/\/www.codechef.com\/viewsolution\/7183029\">https:\/\/www.codechef.com\/viewsolution\/7183029<\/a><\/li>\n<li><a href=\"https:\/\/github.com\/kth-competitive-programming\/kactl\/blob\/f6a97d9e5766c90ee71a97a90cd3faf6cff0ca72\/content\/numerical\/Simplex.h\">https:\/\/github.com\/kth-competitive-programming\/kactl\/blob\/f6a97d9e5766c90ee71a97a90cd3faf6cff0ca72\/content\/numerical\/Simplex.h<\/a><\/li>\n<\/ul>\n<h3>ASC 2. Roads<\/h3>\n<ul>\n<li><a href=\"https:\/\/codeforces.com\/gym\/100197\">https:\/\/codeforces.com\/gym\/100197<\/a><\/li>\n<li><a href=\"https:\/\/www.luogu.com.cn\/problem\/P4412\">https:\/\/www.luogu.com.cn\/problem\/P4412<\/a><\/li>\n<li><a href=\"https:\/\/darkbzoj.cc\/problem\/1937\">https:\/\/darkbzoj.cc\/problem\/1937<\/a><\/li>\n<li><a href=\"https:\/\/darkbzoj.cc\/problem\/3118\">https:\/\/darkbzoj.cc\/problem\/3118<\/a><\/li>\n<\/ul>\n<h3>\u300cONTAK2010\u300dVacation<\/h3>\n<h3>\u300cZJOI2013\u300d\u9632\u5b88\u6218\u7ebf<\/h3>\n<h3>[NOI2008] \u5fd7\u613f\u8005\u62db\u52df<\/h3>\n<ul>\n<li><a href=\"https:\/\/www.luogu.com.cn\/problem\/P3980\">Luogu P3980. [NOI2008] \u5fd7\u613f\u8005\u62db\u52df<\/a><\/li>\n<li><a href=\"https:\/\/darkbzoj.cc\/problem\/3265\">BZOJ #3265. \u5fd7\u613f\u8005\u62db\u52df\u52a0\u5f3a\u7248<\/a><\/li>\n<\/ul>\n<pre class=\"brush: cpp; light: false; title: ; toolbar: true; notranslate\" title=\"\">\r\nconst int N = int(1e4) + 9, M = int(1e3) + 9;\r\n\r\nstruct Simplex {\r\n    DB a&#x5B;N]&#x5B;M];\r\n    int n, m;\r\n\r\n    void init(int _n,int _m) { \/\/a\u77e9\u9635m\u884cn\u5217\r\n        n = _n+1; m = _m+1;\r\n    }\r\n    void pivot(int in, int out) {\r\n        REP(i, m) if(i!=in) a&#x5B;out]&#x5B;i] \/= -a&#x5B;out]&#x5B;in]; \/\/\u91cd\u7f6eout\u7ea6\u675f\r\n        a&#x5B;out]&#x5B;in] = 1\/a&#x5B;out]&#x5B;in];\r\n\r\n        REP(i, n) if (i!=out &amp;&amp; sgn(a&#x5B;i]&#x5B;in])) { \/\/\u91cd\u65b0\u8ba1\u7b97\u5176\u4ed6\u7ea6\u675f\r\n            DB t = a&#x5B;i]&#x5B;in]; a&#x5B;i]&#x5B;in] = 0;\r\n            REP(j, m) a&#x5B;i]&#x5B;j] += t*a&#x5B;out]&#x5B;j];\r\n        }\r\n    }\r\n\r\n    DB run() {\r\n        while (true) {\r\n            int in=0, out=0; DB Min=OO;\r\n            REP_1(i, m) if(sgn(a&#x5B;0]&#x5B;i])&gt;0) {\r\n                in=i;\r\n                break;\r\n            }\r\n            if(!in)return a&#x5B;0]&#x5B;0];\r\n            REP_1(i, n) if(sgn(a&#x5B;i]&#x5B;in])&lt;0&amp;&amp;a&#x5B;i]&#x5B;0]\/-a&#x5B;i]&#x5B;in]&lt;Min) {\r\n                Min=a&#x5B;i]&#x5B;0]\/-a&#x5B;i]&#x5B;in];\r\n                out=i;\r\n            }\r\n            if(!out)throw ; \/\/unbounded\r\n            pivot(in, out);\r\n        }\r\n    }\r\n} fst;\r\n\r\nint main() {\r\n\r\n#ifndef ONLINE_JUDGE\r\n    \/\/freopen(&quot;in.txt&quot;, &quot;r&quot;, stdin);\r\n    \/\/freopen(&quot;out.txt&quot;, &quot;w&quot;, stdout);\r\n#endif\r\n\r\n    \/\/ z D\r\n    \/\/ C A\r\n\r\n    int n, m; RD(m, n); fst.init(n, m);\r\n\r\n    REP_1(j, m) RD(fst.a&#x5B;0]&#x5B;j]);\r\n\r\n    REP_1(i, n) {\r\n        int l, r; RD(l, r, fst.a&#x5B;i]&#x5B;0]);\r\n        FOR_1(j, l, r) fst.a&#x5B;i]&#x5B;j]=-1;\r\n    }\r\n    printf(&quot;%d\\n&quot;, int(fst.run()));\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>\u8d44\u6599 https:\/\/oi-wiki.org\/math\/simplex\/ https:\/\/blog.bill.moe\/simplex-algorithm-notes\/ https:\/\/notes.sshwy.name\/Math\/Linear-Algbra\/LP-and-its-Dual\/ https:\/\/www.zybuluo.com\/winee\/note\/1186606 https:\/\/en.wikipedia.org\/wiki\/Simplex_algorithm https:\/\/en.wikipedia.org\/wiki\/Ellipsoid_method https:\/\/en.wikipedia.org\/wiki\/Interior-point_method https:\/\/www.codechef.com\/viewsolution\/7183029 https:\/\/github.com\/kth-competitive-programming\/kactl\/blob\/f6a97d9e5766c90ee71a97a90cd3faf6cff0ca72\/content\/numerical\/Simplex.h ASC 2. Roads https:\/\/codeforces.com\/gym\/100197 https:\/\/www.luogu.com.cn\/problem\/P4412 https:\/\/darkbzoj.cc\/problem\/1937 https:\/\/darkbzoj.cc\/problem\/3118 \u300cONTAK2010\u300dVacation \u300cZJOI2013\u300d\u9632\u5b88\u6218\u7ebf [NOI2008] \u5fd7\u613f\u8005\u62db\u52df Luogu P3980. [NOI2008] \u5fd7\u613f\u8005\u62db\u52df BZOJ #3265. \u5fd7\u613f\u8005\u62db\u52df\u52a0\u5f3a\u7248 const int N = int(1e4) + 9, M = int(1e3) + 9; struct Simplex { DB a&#x5B;N]&#x5B;M]; int n, m; void init(int _n,int _m) { \/\/a\u77e9\u9635m\u884cn\u5217 n [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","enabled":false}}},"categories":[1],"tags":[],"class_list":["post-1975","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-vR","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/1975","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/comments?post=1975"}],"version-history":[{"count":1,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/1975\/revisions"}],"predecessor-version":[{"id":1976,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/1975\/revisions\/1976"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=1975"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=1975"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=1975"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}