2021牛客暑期多校训练营5-6

牛客5

K King of Range

思路：对于每个询问，枚举r，找到第一个不符合条件的l；可以知道l是只会右移的；用单调队列维护递减的最大值，递增的最小值，就可以判断当前l是否符合条件了。

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int const N=1e5+5;
int n,m,,hdx,tlx,hdn,tln;
int a[N],mx[N],mn[N];
ll ans;
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    for(int i=1,k;i<=m;i++)
    {
        scanf("%d",&k); ans=0;
        hdx=hdn=1; tlx=tln=0;
        for(int r=1,l=1;r<=n;r++)
        {
            while(hdx<=tlx&&a[mx[tlx]]<a[r])tlx--; mx[++tlx]=r;
            while(hdn<=tln&&a[mn[tln]]>a[r])tln--; mn[++tln]=r;
            while(l<r&&a[mx[hdx]]-a[mn[hdn]]>k)
            {
                if(mx[hdx]==l&&hdx<=tlx)hdx++;
                if(mn[hdn]==l&&hdn<=tln)hdn++;
                l++;
            }
            ans+=l-1;
        }
        printf("%lld\n",ans);
    }
    return 0;
}

H Holding Two

签到题：写出两行可以的情况然后重复这两行即可

#include <bits/stdc++.h>
using namespace std;
int a[1024][1024];
int main()
{
    int n, m;
    cin >> n >> m;
    int sum = 1;
    while (sum <= n)
    {
        for (int i = 1; i <= 4; i++)
        {
            for (int j = 1; j <= m; j++)
            {
                if (i == 1 || i == 4)
                {
                    if (j % 2 == 1)
                        cout << 1;
                    else
                        cout << 0;
                }
                else
                {
                    if (j % 2 == 0)
                        cout << 1;
                    else
                        cout << 0;
                }
            }
            cout << endl;
            sum++;
            if (sum > n)
                break;
        }
    }
 
    return 0;
}

牛客6

I Intervals on the Ring

思路：连续1表示需要交集的部分，那么就这样构造, (5,2), (9,5),(13,10),(17,14)记录每一个连续的l,r即可,ri→li−1即可，最后特判最后一个和第一个是否相连即可。

#include <bits/stdc++.h>
using namespace std;
const int N = 1e4;
struct node
{
    int l;
    int r;
} a[N];
bool cmp(node x, node y)
{
    return x.l < y.l;
}
int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n, m;
        cin >> n >> m;
        int l, r;
        for (int i = 0; i < m; i++)
        {
            cin >> a[i].l >> a[i].r;
        }
        sort(a, a + m, cmp);
        cout << m << endl;
        cout << a[0].l << ' ' << a[m - 1].r << endl;
        for (int i = 1; i < m; i++)
        {
            cout << a[i].l << " " << a[i - 1].r << endl;
        }
    }
    return 0;

Hamburger Steak

构造题目：每个汉堡无论被几个锅做，都是ai那么最大的时间就是max(ai,sum/m+(sum)

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int a[N];
void main()
{
    int n,m;
    scanf("%lld%lld", &n, &m);
    int sum = 0, maxn = 0;
    for(int i = 1; i <= n; i ++)
    {
        scanf("%lld", &a[i]);
        sum += a[i];
        maxn = max(maxn,a[i]);
    }
    int sz = max(maxn, sum / m + (sum % m != 0));
    int now = sz;
    int cnt = 1;
    for(int i = 1; i <= n; i ++)
    {
        if(now >= a[i])
        {
            printf("1 %d %lld %lld\n", cnt, sz - now, sz - now + a[i]);
            now -= a[i];
            if(!now) now = sz,cnt ++;
        }
        else
        {
            printf("2 %d %lld %lld %d %lld %lld\n", cnt + 1, 0, a[i] - now, cnt, sz - now, sz);
            now = sz - (a[i] - now);
            cnt ++;
        }
    }
}