P3611 [USACO17JAN] Cow Dance Show S

合集 - 数据结构(28)

1.P3957 [NOIP2017 普及组] 跳房子2024-03-06 2.P2034 选择数字2024-03-09 3.P1714 切蛋糕2024-03-09 4.E - Insert or Erase2024-03-10 5.P4147 玉蟾宫2024-03-10 6.P2866 [USACO06NOV] Bad Hair Day S2024-03-10 7.P2032 扫描2024-03-10 8.P1884 [USACO12FEB] Overplanting S2024-03-10 9.P5905 【模板】全源最短路（Johnson）2024-03-11 10.P1801 黑匣子2024-03-29 11.P2168 [NOI2015] 荷马史诗2024-03-30 12.P8306 【模板】字典树2024-03-30 13.P1481 魔族密码2024-03-30 14.P4341 [BJWC2010] 外星联络2024-04-01 15.P1470 [USACO2.3] 最长前缀 Longest Prefix2024-04-01 16.P3384 【模板】重链剖分/树链剖分2024-04-03 17.P10288 [GESP样题八级] 区间2024-04-16 18.P2161 [SHOI2009] 会场预约2024-04-17 19.P1878 舞蹈课2024-05-17 20.P9691 [GDCPC2023] Base Station Construction2024-05-18

21.P3611 [USACO17JAN] Cow Dance Show S2024-05-20

22.F. Cutting Game2024-05-21 23.G. Money Buys Less Happiness Now2024-05-22 24.D. In Love2024-06-29 25.F. Selling a Menagerie2024-06-29 26.D. Learning to Paint2024-07-19 27.P4588 [TJOI2018] 数学计算2024-07-20 28.P3522 [POI2011] TEM-Temperature2024-07-21

原题链接

题解

一句话总结：第 $i$ 头奶牛继承场上 $k$ 头奶牛里结束时间最短的

code

#include<bits/stdc++.h>
using namespace std;
int n,t;
int d[100005];

int check(int k)
{
    priority_queue<int,vector<int> ,greater<int> > q;
    for(int i=1;i<=n;i++)
    {
        if(q.size()<k) q.push(d[i]);
        else
        {
            q.push(d[i]+q.top());
            q.pop();
        }
    }

    while(q.size()>1) q.pop();
    return q.top()<=t;
}
int main()
{

    cin>>n>>t;

    for(int i=1;i<=n;i++) cin>>d[i];


    int l=0,r=1e4;
    while(l+1<r)
    {
        int mid=(l+r)/2;

        if(check(mid)) r=mid;
        else l=mid;
    }

    cout<<r<<endl;
    return 0;
}