30分求调
查看原帖
30分求调
976822
happypig53楼主2023/10/5 19:55
#include<bits/stdc++.h>
#define  ll long long
#define mn 100005
using namespace std;
ll n,c;
stack<ll>z;
int main()
{
    cin>>n>>c;
    z.push(3000000005);
    for(int i=0;i<n;i++)
    {
        ll op;
        cin>>op;
        if(z.size()<c+1)
        {
            if(z.top()<op)
            {
                while(z.top()<op&&z.size()>0)
                {
                    cout<<z.top()<<" ";
                    z.pop();
                }
            }
            z.push(op);
        }else if(z.size()==c+1)
        {
            cout<<z.top()<<" ";
            z.pop();
            if(z.top()<op)
            {
                while(z.top()<op&&z.size()>0)
                {
                    cout<<z.top()<<" ";
                    z.pop();
                }
            }
            z.push(op);
        }
    }
    if(z.size()>1)
    {
        for(int i=0;i>=0;i++)
        {
            cout<<z.top()<<" ";
            z.pop();
            if(z.size()==1)
            {
                return 0;
            }
        }
    }

}

弱鸡代码求调30分

2023/10/5 19:55
加载中...