이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 999999999999
ll MOD=1000000006;
#define round fixed<<setprecision(2)<<
#define all(x) x.begin(),x.end()
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n,d;
cin>>n>>d;
ll arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
ll ans=0;
deque<int>dq;
for(int i=n-1;i>=0;i--)
{
while(!dq.empty() && dq.front()<=arr[i])
dq.pop_front();
dq.push_front(arr[i]);
ans=max(ans,(ll)dq.size());
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |