技術標籤：寒假訓練c++

寒假訓練第八天-Codeforces Round #494 (Div. 3)

前言：本來定的週日去補之前的題呢，然後給學弟們找寒假訓練的內容忙了一天，然後家裡又發生了一系列事情。今天的是補得昨天的題，仍然還是四道，等會有場div2，希望別掉分，時間不多了，還是隻粘程式碼吧，明天會把這些天的題都補一下（補div3的，div2實力不夠）。

題目連結-https://codeforces.com/contest/1003

A-Polycarp’s Pockets

int a[110], ok[110], ma;
int32_t main()
{
    ICO;
    int n =
 
 read();
    for(int i = 1; i <= n; i++)
    {
        a[i] = read();
        ok[a[i]]++;
        ma = max(ma, ok[a[i]]);
    }
    cout << ma;
    return 0;
}

B-Binary String Constructing

int32_t main()
{
    ICO;
    int a, b, x;
    cin >> a >> b >> x;
    string s1, s2,
 
 ss;
    if(a > b) ss = "01", s1 = "1", s2 = "0";
    else ss = "10", s1 = "0", s2 = "1";
    for(int i = 1; i <= x >> 1; i++) cout << ss;
    if(x & 1)
    {
        if(a <= b) swap(a, b);
        for(int i = 1; i <=
 
 a - (x >> 1); i++) cout << s2;
        for(int i = 1; i <= b - (x >> 1); i++) cout << s1;
    }
    else
    {
        if(a > b) swap(a, b);
        for(int i = 1; i <= a - (x >> 1); i++) cout << s1;
        for(int i = 1; i <= b - (x >> 1); i++) cout << s2;
    }
    return 0;
}

C-Intense Heat

const int maxn = 5e3 + 10;
int a[maxn], s[maxn];
int32_t main()
{
    ICO;
    int n, k;
    double res = 0;
    cin >> n >> k;
    for(int i = 1; i <= n; i++) {cin >> a[i]; s[i] = s[i - 1] + a[i];}
    for(int i = 1; i <= n; i++)
        for(int j = i + k - 1; j <= n; j++)
            res = max(res, (s[j] - s[i - 1]) * 1.0 / (j - i + 1));
    cout << fixed << setprecision(10) << res << endl;
    return 0;
}

D- Coins and Queries

int a[32];
int32_t main()
{
    ICO;
    int n, q, x, res, t;
    cin >> n >> q;
    for(int i = 1; i <= n; i++) {cin >> x; a[(int)log2(x)]++;}
    while(q--)
    {
        res = 0;
        cin >> x;
        for(int i = 31; i >= 0; i--)
        {
            t = min(a[i], x >> i);
            res += t;
            if((x -= t * (1 << i)) <= 0) break;
        }
        if(x) cout << -1 << endl;
        else cout << res << endl;
    }
    return 0;
}

總結：事情可能會少一點，還是把訓練恢復正軌，盡力吧 ，感覺上週還是在混日子。