{"id":1587,"date":"2024-11-18T22:26:56","date_gmt":"2024-11-18T14:26:56","guid":{"rendered":"https:\/\/www.forillusion.com\/?p=1587"},"modified":"2025-02-14T11:39:02","modified_gmt":"2025-02-14T03:39:02","slug":"greedy-algorithm-training-question-solution","status":"publish","type":"post","link":"https:\/\/www.forillusion.com\/index.php\/greedy-algorithm-training-question-solution\/","title":{"rendered":"\u8d2a\u5fc3\u7b97\u6cd5\u4e13\u8bad\u9898\u89e3"},"content":{"rendered":"\n

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

P1007. \u72ec\u6728\u6865<\/h2>\n\n\n\n

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

\u5f53\u4e24\u4eba\u9762\u5bf9\u9762\u76f8\u78b0\u65f6\uff0c\u4e24\u4eba\u90fd\u4f1a\u8f6c\u5411\u884c\u8d70\uff0c \u90a3\u53ef\u4ee5\u770b\u6210\u4e24\u4e2a\u4eba\u4ea4\u9519\u800c\u8fc7\u3002<\/p>\n\n\n\n

\u6c42\u6700\u5c0f\u65f6\u95f4\uff0c\u8ba1\u7b97\u51fa\u6bcf\u4e2a\u4eba\u5230\u8fbe\u4e24\u8fb9\u7684\u6700\u5c0f\u65f6\u95f4\uff0c\u6240\u6709\u65f6\u95f4\u4e2d\u6700\u5927\u7684\u4e00\u4e2a\u5373\u4e3a\u6240\u6709\u4eba\u79bb\u5f00\u6865\u9700\u8981\u7528\u7684\u65f6\u95f4\u3002<\/p>\n\n\n\n

\u6c42\u6700\u5927\u65f6\u95f4\uff0c\u8ba1\u7b97\u51fa\u6bcf\u4e2a\u4eba\u5230\u8fbe\u4e24\u8fb9\u7684\u6700\u5927\u65f6\u95f4\uff0c\u6240\u6709\u65f6\u95f4\u4e2d\u6700\u5927\u7684\u4e00\u4e2a\u5373\u4e3a\u6240\u6709\u4eba\u79bb\u5f00\u6865\u9700\u8981\u7528\u7684\u65f6\u95f4\u3002<\/p>\n\n\n\n

#include<bits\/stdc++.h>\nusing namespace std;\nint main()\n{\n \tint l,n,a[5003];\n    cin>>l>>n;\n    for (int i=1;i<=n;i++)\n    \tcin>>a[i];\n    \/\/ sort(a+1,a+n+1);\n    int x=int(l\/2.0+0.5);\n    int ans1=0,ans2=0;\n\tfor (int i=1;i<=n;i++)\n        ans1=max(min(a[i],l+1-a[i]),ans1);\n    \n    for (int i=1;i<=n;i++)\n        ans2=max(max(a[i],l+1-a[i]),ans2);\n\n    cout<<ans1<<\" \"<<ans2<<endl;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
P1031. [NOIP2002 \u63d0\u9ad8\u7ec4] \u5747\u5206\u7eb8\u724c<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u7edf\u8ba1\u7eb8\u724c\u603b\u6570\uff0c\u8ba1\u7b97\u5e73\u5747\u6570\uff0c\u5373\u4e3a\u6bcf\u4e2a\u7eb8\u724c\u5806\u7684\u6700\u7ec8\u7eb8\u724c\u6570\u3002<\/p>\n\n\n\n
\u4ece\u5de6\u5f80\u53f3\u904d\u5386\uff0c\u5982\u679c\u5f53\u524d\u7eb8\u724c\u5806\u4e0d\u7b49\u4e8e\u5e73\u5747\u6570\uff0c\u5219\u5c06\u5176\u4e0e\u5e73\u5747\u6570\u7684\u5dee\u7d2f\u52a0\u7684\u53f3\u4fa7\u7684\u7eb8\u724c\u961f\uff1a\u5982\u679c\u5f53\u524d\u7eb8\u724c\u6570\u5927\u4e8e\u5e73\u5747\u6570\uff0c\u5219\u76f8\u5f53\u4e8e\u628a\u591a\u51fa\u6765\u7eb8\u724c\u653e\u7f6e\u5230\u53f3\u4fa7\uff1b\u5982\u679c\u5f53\u524d\u7eb8\u724c\u6570\u5c0f\u4e8e\u5e73\u5747\u6570\uff0c\u5219\u76f8\u7b49\u4e8e\u4ece\u53f3\u4fa7\u7d22\u53d6\u7eb8\u724c\u3002\u64cd\u4f5c\u5b8c\u6210\u540e\u589e\u52a0\u4e00\u4e2a\u64cd\u4f5c\u8ba1\u6570\u3002\u5355\u6b21\u64cd\u4f5c\u540e\u5f53\u524d\u7eb8\u724c\u5806\u7684\u6570\u91cf\u5c06\u4f1a\u53d8\u6210\u5e73\u5747\u6570\uff0c\u7ed3\u675f\u540e\u6240\u6709\u7684\u7eb8\u724c\u90fd\u5c06\u53d8\u6210\u5e73\u5747\u6570\u3002<\/p>\n\n\n\n
#include<bits\/stdc++.h>\nusing namespace std;\nint main()\n{\n    int a[10001];\n    long long avg=0;\n    int n;\n    cin>>n;\n    for (int i=1;i<=n;i++)\n    {\n        cin>>a[i];\n        avg+=a[i];\n    }\n    avg\/=n;\n\n    int ans=0,x=0;\n    for (int i=1;i<=n;i++)\n    {\n        if (a[i]!=avg)\n        {\n            a[i+1]=a[i+1]+a[i]-avg;\n            ans++;\n        }\n    }\n\tcout<<ans<<endl;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
P2695. \u9a91\u58eb\u7684\u5de5\u4f5c<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u5c06\u5934\u7684\u5927\u5c0f\u548c$z_i$\u90fd\u8fdb\u884c\u4ece\u5c0f\u5230\u5927\u7684\u6392\u5e8f\uff0c\u5224\u65ad\u5f53\u524d\u7684$z_i$\u662f\u5426\u5927\u4e8e\u5f53\u524d\u7684\u5934\uff0c\u5927\u4e8e\u7684\u8bdd\u8ba1\u5165\u91d1\u5e01\uff0c\u4e24\u4e2a\u6570\u7ec4\u6307\u9488\u540c\u65f6\u5411\u540e\u79fb\u52a8\u3002\u5426\u8005$z$\u6307\u9488\u5411\u540e\u79fb\u52a8\u3002<\/p>\n\n\n\n
\u7a0b\u5e8f\u4e2d\u4f7f\u7528\u5c0f\u6839\u5806\u5b9e\u73b0\u6392\u5e8f\u3002<\/p>\n\n\n\n
\nint n,m;\nint x;\n\npriority_queue<int,vector<int>,greater<int> > q1;\npriority_queue<int,vector<int>,greater<int> > q2;\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        q1.push(x);\n    }\n    F(i,1,m)\n    {\n        CI x;\n        q2.push(x);\n    }\n\n    LL ans=0;\n    while (!q1.empty() && !q2.empty())\n    {\n        if (q1.top()<=q2.top())\n        {\n            q1.pop();\n            ans+=q2.top();\n            q2.pop();\n        }\n        else\n        {\n            q2.pop();\n        }\n    }\n    if (!q1.empty())\n    {\n        CO \"you died!\" L;\n        return 0;\n    }\n    else CO ans L;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
P5639. \u3010CSGRound2\u3011\u5b88\u5e8f\u8005\u7684\u5c0a\u4e25<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u5c06\u8fde\u7eed\u76840\u6216\u8fde\u7eed\u76841\u770b\u6210\u4e00\u5757\uff0c\u6570\u4e00\u5171\u6709\u591a\u5c11\u5757\u5373\u53ef\u3002<\/p>\n\n\n\n
int n,x,y,ans;\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI n;\n    CI x;\n    ans=1;\n    F(i,2,n)\n    {\n        CI x;\n        if (x!=y) \n        {\n            ans++;\n            y=x;\n        }\n    }\n    CO ans L;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
P1056. [NOIP2008 \u666e\u53ca\u7ec4] \u6392\u5ea7\u6905<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u5148\u7edf\u8ba1\u6bcf\u4e00\u884c\u548c\u6bcf\u4e00\u5217\u4e00\u5171\u6709\u591a\u5c11\u4eba\u4f1a\u4ea4\u5934\u63a5\u8033\uff0c\u7136\u540e\u6309\u6570\u91cf\u4ece\u5927\u5230\u5c0f\u6392\u5e8f\uff0c\u518d\u4ece\u5927\u5230\u5c0f\u8bb0\u5f55\u524dK\u3001L\u4e2a\u884c\u5217\uff0c\u6700\u540e\u6309\u5e8f\u8f93\u51fa\u5373\u53ef\u3002<\/p>\n\n\n\n
int M,N,K,L,D;\nint x,y,p,q;\nmap<int,int> k;\nmap<int,int> l;\npair<int,int> kk[1005];\npair<int,int> ll[1005];\nint kkk[1005],lll[1005];\n\nbool cmp(pair<int,int> a,pair<int,int> b)\n{\n    return a.second>b.second;\n}\n\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI M>>N>>K>>L>>D;\n    F(i,1,D)\n    {\n        CI x>>y>>p>>q;\n        if (x==p) l[min(y,q)]++;\n        elif (y==q) k[min(x,p)]++;\n    }\n\n    int indexl = 1;\n    for (auto i : l)\n        ll[indexl++]=i;\n    indexl--;\n\n    int indexk=1;\n    for (auto i:k)\n        kk[indexk++]=i;\n    indexk--;\n\n    sort(kk+1,kk+indexk+1,cmp);\n    sort(ll+1,ll+indexl+1,cmp);\n\n    F(i,1,K)\n        kkk[kk[i].first] = 1;\n    F(i,1,L)\n        lll[ll[i].first] = 1;\n\n    F(i,1,M)\n        if (kkk[i]) CO i P;\n    cout<<endl;\n    F(i,1,N)\n        if (lll[i]) CO i P;\n    cout<<endl;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
P1090. [NOIP2004 \u63d0\u9ad8\u7ec4] \u5408\u5e76\u679c\u5b50 \/ [USACO06NOV] Fence Repair G<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u56e0\u4e3a\u6bcf\u6b21\u5408\u5e76\u679c\u5b50\u65f6\u90fd\u4f1a\u5bfc\u81f4\u6700\u5148\u5408\u5e76\u7684\u679c\u5b50\u88ab\u91cd\u590d\u8ba1\u7b97\u4e00\u6b21\uff0c\u6240\u4ee5\u8ba9\u6700\u5c11\u7684\u679c\u5b50\u5806\u91cd\u590d\u8bb0\u5f55\u6700\u591a\u6b21\uff0c\u6700\u591a\u7684\u679c\u5b50\u5806\u8bb0\u5f55\u6700\u5c11\u6b21\uff0c\u5373\u6bcf\u6b21\u5408\u5e76\u6570\u91cf\u6700\u5c11\u7684\u4e24\u5806\u679c\u5b50\uff0c\u7136\u540e\u5c06\u5408\u5e76\u540e\u7684\u679c\u5b50\u5806\u653e\u56de\u961f\u5217\u3002<\/p>\n\n\n\n
\u4f7f\u7528\u5c0f\u6839\u5806\u53ef\u4ee5\u5b9e\u73b0\u6bcf\u6b21\u53d6\u51fa\u6700\u5c0f\u7684\u4e24\u5806\u679c\u5b50\uff0c\u63d2\u5165\u65b0\u7684\u679c\u5b50\u5806\u53ef\u4ee5\u81ea\u52a8\u6392\u5e8f\u3002<\/p>\n\n\n\n
int n,x,ans;\npriority_queue<int,vector<int>,greater<int> > q;\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 x;\n        q.push(x);\n    }\n    F(i,1,n-1)\n    {\n        int a=q.top();\n        q.pop();\n        int b=q.top();\n        q.pop();\n        ans+=a+b;\n        q.push(a+b);\n    }\n    CO ans L;\n    \n    return 0;\n}<\/code><\/pre>\n\n\n\n
P1106. \u5220\u6570\u95ee\u9898<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u8fdb\u884cn\u6b21\u67e5\u627e\uff0c\u6bcf\u6b21\u67e5\u627e\u90fd\u4ece\u5934\u5230\u5c3e\u904d\u5386\u5b57\u7b26\u4e32\u7136\u540e\u627e\u5230\u7b2c\u4e00\u4e2a\u5cf0\u9876\uff0c\u5220\u9664\u540e\u518d\u6d88\u9664\u524d\u7f000\u3002<\/p>\n\n\n\n
int n;\nint a[1000];\nstring s;\nint k;\nint main()\n{\n    \/\/ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n    CI s;\n    CI n;\n    F(i,1,n)\n    {\n        int j=0;\n        while (s[j]>=s[j-1]&&j<s.size())\n            j++;\n        s.erase(j-1,1);\n        while (s[0]=='0')\n            s.erase(0,1);\n    }\n    if (s.size()==0)\n        CO 0 L;\n    else\n        CO s L;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
P2630. \u56fe\u50cf\u53d8\u6362<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
\u624b\u63a8\u53ef\u5f97\uff0c\u56fe\u50cf\u7684\u53d8\u5316\u53ea\u4f1a\u67098\u79cd\uff0cA\u3001B\u3001C\u3001D\u3001AA\u3001AB\u3001AC\u3001AD\u3002\u6240\u4ee5\u53ea\u9700\u8981\u5224\u65ad\u5c5e\u4e8e\u8fd98\u79cd\u7684\u54ea\u4e00\u4e2a\u5c31\u53ef\u4ee5\u4e86\u3002<\/p>\n\n\n\n
int a,b,c,d,e,f,g,h,i;\nint A,B,C,D,E,F,G,H,I;\nint main()\n{\n    CI a>>b>>c>>d>>e>>f>>g>>h>>i;\n    CI A>>B>>C>>D>>E>>F>>G>>H>>I;\n    if (A==g&&B==d&&C==a&&D==h&&E==e&&F==b&&G==i&&H==f&&I==c) CO \"A\" L;\n    elif (A==c&&B==f&&C==i&&D==b&&E==e&&F==h&&G==a&&H==d&&I==g) CO \"B\" L;\n    elif (A==c&&B==b&&C==a&&D==f&&E==e&&F==d&&G==i&&H==h&&I==g) CO \"C\" L;\n    elif (A==g&&B==h&&C==i&&D==d&&E==e&&F==f&&G==a&&H==b&&I==c) CO \"D\" L;\n    elif (A==i&&B==h&&C==g&&D==f&&E==e&&F==d&&G==c&&H==b&&I==a) CO \"AA\" L;\n    elif (A==a&&B==b&&C==c&&D==d&&E==e&&F==f&&G==g&&H==h&&I==i) CO \"AB\" L;\n    elif (A==a&&B==d&&C==g&&D==b&&E==e&&F==h&&G==c&&H==f&&I==i) CO \"AC\" L;\n    elif (A==i&&B==f&&C==c&&D==h&&E==e&&F==b&&G==g&&H==d&&I==a) CO \"AD\" L;\n    else CO \"Poland cannot into space!!!\" L;\n    return 0;\n}\n<\/code><\/pre>\n\n\n\n
P5514. [MtOI2019] \u6c38\u591c\u7684\u62a5\u5e94<\/h2>\n\n\n\n
\u9898\u76ee\u63cf\u8ff0<\/a><\/p>\n\n\n\n
a^b<=a+b\uff0c\u6240\u4ee5\u8981\u8ba9\u5f02\u6216\u548c\u6700\u5c0f\uff0c\u90a3\u5c31\u8ba9\u6240\u6709\u6570\u5b57\u5f02\u6216\u5728\u4e00\u8d77\u5c31\u53ef\u4ee5\u4e86\u3002<\/p>\n\n\n\n
int n,ans,a;\nint main()\n{\n    CI n;\n    while (n--)\n    {\n        CI a;\n        ans^=a;\n    }\n    CO ans L;\n    return 0;\n}<\/code><\/pre>\n\n\n\n
<\/p>\n","protected":false},"excerpt":{"rendered":"
P1007. \u72ec\u6728\u6865 \u9898\u76ee\u63cf\u8ff0 \u5f53\u4e24\u4eba\u9762\u5bf9\u9762\u76f8\u78b0\u65f6\uff0c\u4e24\u4eba\u90fd\u4f1a\u8f6c\u5411\u884c\u8d70\uff0c \u90a3\u53ef\u4ee5\u770b\u6210\u4e24\u4e2a\u4eba\u4ea4\u9519\u800c\u8fc7\u3002 \u6c42\u6700\u5c0f\u65f6\u95f4\uff0c\u8ba1\u7b97\u51fa\u6bcf\u4e2a\u4eba\u5230\u8fbe\u4e24 …<\/p>","protected":false},"author":1,"featured_media":1589,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3,35],"tags":[40,12,34,22,39],"class_list":["post-1587","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-3","category-35","tag-codeforces","tag-12","tag-34","tag-22","tag-39"],"_links":{"self":[{"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/posts\/1587","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=1587"}],"version-history":[{"count":1,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/posts\/1587\/revisions"}],"predecessor-version":[{"id":1720,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/posts\/1587\/revisions\/1720"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/media\/1589"}],"wp:attachment":[{"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/media?parent=1587"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/categories?post=1587"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.forillusion.com\/index.php\/wp-json\/wp\/v2\/tags?post=1587"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}