{"id":1162,"date":"2023-12-20T11:00:08","date_gmt":"2023-12-20T03:00:08","guid":{"rendered":"http:\/\/www.forillusion.com\/?p=1162"},"modified":"2025-02-14T11:39:18","modified_gmt":"2025-02-14T03:39:18","slug":"basic-algorithms-training50-2-greed","status":"publish","type":"post","link":"https:\/\/www.forillusion.com\/index.php\/basic-algorithms-training50-2-greed\/","title":{"rendered":"\u7b97\u6cd5\u57fa\u7840\u8bad\u7ec3 50 \u9898\uff08\u4e8c\uff09 \u8d2a\u5fc3"},"content":{"rendered":"\n

<\/div><\/p>\n\n\n\n

#JC0201. \u6d3b\u52a8\u5b89\u6392<\/h2>\n\n\n\n

\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n

\u5bf9\u6570\u636e\u6309\u7167\u7ed3\u675f\u65f6\u95f4\u4ece\u5c0f\u5230\u5927\u6392\u5e8f\uff0c\u76f8\u540c\u7ed3\u675f\u65f6\u95f4\u7684\u6309\u5f00\u59cb\u65f6\u95f4\u4ece\u5927\u9053\u5c0f\u6392\u5e8f\u3002\u7136\u540e\u4f7f\u7528\u4e00\u4e2a\u53d8\u91cf\u8bb0\u5f55\u65f6\u95f4\u6307\u9488\uff0c\u4e0d\u65ad\u9009\u53d6\u5f00\u59cb\u65f6\u95f4\u5927\u4e8e\u7b49\u4e8e\u65f6\u95f4\u6307\u9488\u7684\u4f1a\u8bae\u5e76\u628a\u6307\u9488\u79fb\u5230\u8be5\u4f1a\u8bae\u7684\u7ed3\u675f\u65f6\u95f4\u3002<\/p>\n\n\n\n

#include<bits\/stdc++.h>\npair<int,int> p[1001];\nint n,ans,t;\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI n;\n    F(i,1,n)\n    {\n        CI p[i].second>>p[i].first;\n    } \n    sort(p+1,p+n+1);\n\n    ans=1;\n    t=p[1].first;\n    F(i,2,n)\n    {\n        if (p[i].second>=t)\n        {\n            ans++;\n            t=p[i].first;\n        }\n    }\n\n    CO ans L;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
#JC0202. \u79cd\u6811<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u5bf9\u79cd\u6811\u533a\u95f4\u6309\u7167\u7ed3\u675f\u4f4d\u7f6e\u4ece\u5c0f\u5230\u5927\u6392\u5e8f\uff0c\u5bf9\u4e8e\u76f8\u540c\u7ed3\u675f\u4f4d\u7f6e\u7684\u6309\u7167\u5f00\u59cb\u4f4d\u7f6e\u4ece\u5927\u5230\u5c0f\u6392\u5e8f\u3002\u7136\u540e\u7528\u4e00\u4e2a\u6570\u7ec4\u6a21\u62df\u79cd\u6811\u7684\u60c5\u51b5\uff0c\u5bf9\u4e8e\u6bcf\u4e00\u79cd\u79cd\u6811\u533a\u95f4\u4ece\u533a\u95f4\u672b\u5c3e\u5f80\u524d\u904d\u5386\uff1a\u5982\u679c\u8be5\u5730\u5df2\u6709\u6811\uff0c\u5f85\u79cd\u6811\u51cf\u4e00\uff1b\u5982\u679c\u6ca1\u6709\u6811\uff0c\u5219\u79cd\u6811\uff0c\u5df2\u79cd\u6811\u52a0\u4e00\uff0c\u5f85\u79cd\u6811\u51cf\u4e00\uff0c\u76f4\u5230\u5f85\u79cd\u6811\u4e3a\u96f6\u3002<\/p>\n\n\n\n
#include<bits\/stdc++.h>\nint n,m,a[30004],ans;\nstruct tree{\n    int s,e,n;\n} t[10001];\n\nbool cmp(tree t1,tree t2)\n{\n    if (t1.e<t2.e) return 1;\n    if (t1.e==t2.e) return t1.s>t2.s;\n    return 0;\n}\n\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI n>>m;\n    F(i,1,m)\n    {\n        CI t[i].s>>t[i].e>>t[i].n;\n    }\n    sort(t+1,t+m+1,cmp);\n    \n    F(i,1,m)\n    {\n        for (int j=t[i].s;j<=t[i].e&&t[i].n;j++)\n            if (a[j]) t[i].n--; \n\n        for (int j=t[i].e;j>=t[i].s&&t[i].n;j--)\n            if (!a[j])\n            {\n                t[i].n--;\n                ans++;\n                a[j]=1;\n            }\n    }\n    CO ans L;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
#JC0203. \u55b7\u6c34\u88c5\u7f6e<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u9996\u5148\u8981\u5c06\u8fd9\u4e2a\u4e8c\u7ef4\u95ee\u9898\u8f6c\u6362\u4e3a\u4e00\u7ef4\u95ee\u9898\uff0c\u5728\u8f93\u5165\u65f6\u8fc7\u6ee4\u6389\u6240\u6709\u534a\u5f84\u5c0f\u4e8e\u7b49\u4e8e\u8349\u576a\u5bbd\u5ea6\u4e00\u534a\u7684\u503c\uff0c\u7136\u540e\u518d\u5229\u7528\u52fe\u80a1\u5b9a\u7406\u7b97\u51fa\u6bcf\u4e2a\u55b7\u5934\u5728\u8349\u576a\u7684\u957f\u8fb9\u4e0a\u80fd\u8986\u76d6\u7684\u8303\u56f4\u5e76\u8bb0\u5f55\u8d77\u59cb\u7ec8\u6b62\u503c\u3002\u5bf9\u8d77\u59cb\u503c\u4ece\u5c0f\u5230\u5927\u6392\u5e8f\u3002\u7136\u540e\u4f7f\u7528\u4e00\u4e2a\u6307\u9488\u8bb0\u5f55\u5f53\u524d\u55b7\u6c34\u8986\u76d6\u5230\u7684\u4f4d\u7f6e\u3002\u904d\u5386\u6240\u6709\u7684\u55b7\u5934\uff0c\u5148\u627e\u5230\u80fd\u8986\u76d6\u5f53\u524d\u6307\u9488\u7684\u6240\u6709\u55b7\u5934\u4e2d\u80fd\u8986\u76d6\u6700\u8fdc\u7684\u90a3\u4e2a\u55b7\u5934\uff0c\u6253\u5f00\u8fd9\u4e2a\u55b7\u5934\u5e76\u5c06\u6307\u9488\u79fb\u5230\u8fd9\u4e2a\u55b7\u5934\u7684\u8986\u76d6\u7ec8\u6b62\u503c\u5904\u3002<\/p>\n\n\n\n
#include<bits\/stdc++.h>\nint t,n,l,w,ans;\ndouble z;\nstruct p{\n    int x,R;\n    double l,r;\n}a[20000];\n\nbool cmp(p a1,p a2)\n{\n    return a1.l<a2.l;\n}\n\nint main()\n{\n    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI t;\n    while (t--)\n    {\n        CI n>>l>>w;\n        F(i,1,n)\n        {\n            CI a[i].x>>a[i].R;\n            if (a[i].R<=w\/2)\n            {\n                i--;\n                n--;\n                continue;\n            }\n            a[i].l=max(0.0,a[i].x*1.0-sqrt(a[i].R*a[i].R*1.0-w*w\/4.0));\n            a[i].r=min(l*1.0,a[i].x*1.0+sqrt(a[i].R*a[i].R*1.0-w*w\/4.0));\n        }\n        sort(a+1,a+n+1,cmp);\n        int i=0;\n        ans=0;\n        z=0;\n        double m;\n        while (i<n)\n        {\n            i++;\n            if (z>=l) break;\n            m=a[i].r;\n            while (i<n&&a[i+1].l<=z)\n            {\n                i++;\n                m=max(m,a[i].r);\n            }\n            if (a[i].l<=z)\n            {\n                ans++;\n                z=m;\n            }\n            else \n            {\n                ans=-1;\n                break;\n            }\n        }\n        CO ans L;\n    }\n    return 0;\n}<\/code><\/pre>\n\n\n\n
#JC0205. \u667a\u529b\u5927\u51b2\u6d6a<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u5bf9\u6240\u6709\u9898\u76ee\u6309\u7167\u6263\u6b3e\u4ece\u5927\u5230\u5c0f\u6392\u5e8f\u3002\u518d\u7528\u4e00\u4e2a\u65f6\u95f4\u6570\u7ec4\u6a21\u62df\u505a\u9898\u60c5\u51b5\u3002\u904d\u5386\u6bcf\u4e00\u9053\u9898\uff0c\u4ece\u622a\u6b62\u65f6\u95f4\u4ece\u540e\u5f80\u524d\u627e\uff0c\u76f4\u5230\u627e\u5230\u7a7a\u95f2\u7684\u65f6\u95f4\u5e76\u6807\u8bb0\uff0c\u5982\u679c\u6ca1\u6709\u7a7a\u95f2\u65f6\u95f4\uff0c\u5c31\u8fdb\u884c\u6263\u6b3e\u3002<\/p>\n\n\n\n
#include<bits\/stdc++.h>\nint w,n;\nint b[600];\nstruct s{\n    int t,w;\n} a[600];\n\nbool cmp(s a1,s a2)\n{\n    return a1.w>a2.w;\n}\n\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI w>>n;\n    F(i,1,n)\n        CI a[i].t;\n    F(i,1,n)\n        CI a[i].w;\n    sort(a+1,a+n+1,cmp);\n\n    F(i,1,n)\n    {\n        int t=a[i].t;\n        while (b[t]&&t>0)\n            t--;\n        if (t==0) w-=a[i].w;\n        else\n        {\n            b[t]=1;\n        }\n    }\n    CO w L;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
#JC0206. \u7eaa\u5ff5\u54c1\u5206\u7ec4<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u5148\u5c06\u5956\u54c1\u6309\u4ef7\u683c\u4ece\u5c0f\u5230\u5927\u6392\u5e8f\uff0c\u7136\u540e\u5c06\u4ef7\u683c\u5927\u4e8e\u4e0a\u9650\u7684\u5956\u54c1\u6570\u91cf\u8bb0\u5f55\u4e0b\u6765\uff0c\u5e76\u7528\u6307\u9488\u8bb0\u5f55\u4e0b\u7b2c\u4e00\u4e2a\u5927\u4e8e\u4e0a\u9650\u7684\u5956\u54c1\u7684\u524d\u4e00\u4e2a\u4f4d\u7f6e\uff0c\u7136\u540e\u518d\u7528\u4e00\u4e2a\u6307\u9488\u6307\u5411\u7b2c\u4e00\u4e2a\u5956\u54c1\uff0c\u4e24\u4e24\u914d\u5bf9\uff0c\u5982\u679c\u4ef7\u683c\u4e4b\u548c\u5c0f\u4e8e\u4e0a\u9650\u5c31\u8bb0\u4e3a\u4e00\u7ec4\uff0c\u4e24\u4e2a\u6307\u9488\u540c\u65f6\u79fb\u52a8\uff1b\u5982\u679c\u4ef7\u683c\u4e4b\u548c\u5927\u4e8e\u4e0a\u9650\uff0c\u6307\u5411\u672b\u5c3e\u7684\u6307\u9488\u5355\u72ec\u5411\u524d\u79fb\u52a8\uff0c\u81ea\u5df1\u8bb0\u4e3a\u4e00\u7ec4\u3002<\/p>\n\n\n\n
#include<bits\/stdc++.h>\nint w,n,a[30001];\nint main()\n{\n    cin>>w>>n;\n    for (int i=0;i<n;i++)\n        cin>>a[i];\n    sort(a,a+n);\n    int x=w-a[0],s=0,i,l,r;\n    for (i=n-1;i>=0;i++)\n        if (a[i]>w) s++;\n        else break;\n\n    l=0;\n    r=i;\n    while (l<=r)\n    {\n        if (a[l]+a[r]<=w) \n        {\n            l++;\n            r--;\n        }\n        else r--;\n        s++;\n     }\n     cout<<s<<endl;\n     return 0;\n}<\/code><\/pre>\n\n\n\n
#JC0207. \u6570\u5217\u5206\u6bb5<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u8fdb\u884c\u6a21\u62df\u5373\u53ef\u3002\u4e0d\u65ad\u589e\u52a0\u8bb0\u5f55\u7684\u548c\uff0c\u76f4\u5230\u8d85\u8fc7\u6700\u5927\u503c\uff0c\u7136\u540e\u91cd\u65b0\u5f00\u59cb\u8bb0\u5f55\u3002<\/p>\n\n\n\n
#include<bits\/stdc++.h>\nint n,m,ans=1,t,x;\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI n>>m;\n    F(i,1,n)\n    {\n        CI x;\n        if (x+t>m)\n        {\n            ans++;\n            t=x;\n        }\n        else t+=x;\n    }   \n    CO ans L;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
#JC0208. \u7ebf\u6bb5<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u5bf9\u7ebf\u6bb5\u6309\u7ed3\u675f\u4f4d\u7f6e\u4ece\u5c0f\u5230\u5927\u6392\u5e8f\u3002\u7528\u4e00\u4e2a\u6307\u9488\u8bb0\u5f55\u4f4d\u7f6e\uff0c\u904d\u5386\u6bcf\u4e00\u4e2a\u7ebf\u6bb5\uff0c\u627e\u51fa\u8d77\u6b62\u4f4d\u7f6e\u5927\u4e8e\u7b49\u4e8e\u6307\u9488\u7684\u7ebf\u6bb5\u5e76\u5c06\u6307\u9488\u6307\u5411\u7ed3\u675f\u4f4d\u7f6e\u3002<\/p>\n\n\n\n
#include<bits\/stdc++.h>\nint n,ans;\nstruct s{\n    int s,e;\n} a[1000006];\n\nbool cmp(s a,s b)\n{\n    return a.e<b.e;\n}\n\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI n;\n    F(i,1,n)\n        CI a[i].s>>a[i].e;\n    sort(a+1,a+n+1,cmp);\n\n    int i=0;\n    int t=0;\n    while (i<n)\n    {\n        i++;\n        while (a[i].s<t&&i<n)\n            i++;\n        if (a[i].s>=t) \n        {\n            t=a[i].e;\n            ans++;\n        }\n    }\n\n    CO ans L;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
#JC0209. \u5bb6\u5ead\u4f5c\u4e1a<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u5c06\u4f5c\u4e1a\u6309\u7167\u5b66\u5206\u4ece\u5927\u5230\u5c0f\u6392\u5e8f\u3002\u7528\u4e00\u4e2a\u65f6\u95f4\u6570\u7ec4\u8bb0\u5f55\u505a\u9898\u60c5\u51b5\u3002\u904d\u5386\u6bcf\u4e2a\u4f5c\u4e1a\uff0c\u4ece\u622a\u6b62\u65f6\u95f4\u4ece\u540e\u5f80\u524d\u904d\u5386\uff0c\u76f4\u5230\u627e\u5230\u7a7a\u95f2\u7684\u65f6\u95f4\u5e76\u6807\u8bb0\uff0c\u7d2f\u52a0\u5b66\u5206\u3002\u4f46\u662f\u76f4\u63a5\u8fd9\u6837\u505a\u4f1a\u8d85\u65f6\uff0c\u6240\u4ee5\u8fd8\u9700\u8981\u4f18\u5316\u3002\u518d\u7528\u53e6\u4e00\u4e2a\u65f6\u95f4\u6570\u7ec4\uff0c\u88ab\u6807\u8bb0\u65f6\u8868\u793a\u4ece1\u5230\u5f53\u524d\u65f6\u95f4\u90fd\u6ca1\u6709\u7a7a\u95f2\u65f6\u95f4\u4e86\u3002\u5728\u904d\u5386\u4f5c\u4e1a\u65f6\uff0c\u5982\u679c\u622a\u6b62\u65f6\u95f4\u88ab\u6807\u8bb0\u4e3a\u524d\u9762\u90fd\u6ca1\u7a7a\u95f2\u65f6\u95f4\u65f6\u5c31\u53ef\u4ee5\u4e0d\u518d\u5bfb\u627e\u7a7a\u95f2\u65f6\u95f4\u4e86\u3002\u5728\u5bfb\u627e\u7a7a\u95f2\u65f6\u95f4\u65f6\u5982\u679c\u9047\u5230\u4e86\u88ab\u6807\u8bb0\u6ca1\u6709\u7a7a\u95f2\u65f6\u95f4\u65f6\uff0c\u4e5f\u505c\u6b62\u7ee7\u7eed\u5bfb\u627e\u5e76\u5c06\u8be5\u4f5c\u4e1a\u7684\u5f00\u59cb\u65f6\u95f4\u4e5f\u6807\u8bb0\u4e3a\u6ca1\u6709\u7a7a\u95f2\u65f6\u95f4\u3002<\/p>\n\n\n\n
#include<bits\/stdc++.h>\nint n,ans,t[700005],e[700005];\nstruct s{\n    int t,w;\n} a[1000006];\n\nbool cmp(s a,s b)\n{\n    return a.w>b.w;\n}\n\nint main()\n{\n    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI n;\n    F(i,1,n)\n        CI a[i].t>>a[i].w;\n    sort(a+1,a+n+1,cmp);\n    \n    F(i,1,n)\n    {\n        if (e[a[i].t]) continue;\n        int p=a[i].t;\n        while (t[p]&&p>0&&e[p-1]!=1)\n            p--;\n        if (p>0&&!(t[p]&&e[p-1]))\n        {\n            t[p]=1;\n            ans+=a[i].w;\n        }\n        else e[a[i].t]=1;\n    }\n    CO ans L;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
<\/p>\n","protected":false},"excerpt":{"rendered":"
#JC0201. \u6d3b\u52a8\u5b89\u6392 \u9898\u76ee\u63cf\u8ff0 \u5bf9\u6570\u636e\u6309\u7167\u7ed3\u675f\u65f6\u95f4\u4ece\u5c0f\u5230\u5927\u6392\u5e8f\uff0c\u76f8\u540c\u7ed3\u675f\u65f6\u95f4\u7684\u6309\u5f00\u59cb\u65f6\u95f4\u4ece\u5927\u9053\u5c0f\u6392\u5e8f\u3002\u7136\u540e\u4f7f\u7528\u4e00\u4e2a\u53d8\u91cf\u8bb0\u5f55\u65f6 …<\/p>","protected":false},"author":1,"featured_media":1165,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3,35],"tags":[12,34,22,39],"class_list":["post-1162","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-3","category-35","tag-12","tag-34","tag-22","tag-39"],"_links":{"self":[{"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/posts\/1162","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/comments?post=1162"}],"version-history":[{"count":1,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/posts\/1162\/revisions"}],"predecessor-version":[{"id":1746,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/posts\/1162\/revisions\/1746"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/media\/1165"}],"wp:attachment":[{"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/media?parent=1162"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/categories?post=1162"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/tags?post=1162"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}