이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define F first
#define S second
const ll ool=1e18;
const int ooi=1e9;
const int MOD=1e9+7;
const int N=2e5;
int n,k;
int a[N+5];
ll cnt[N+5];
map <int,int> m;
void subtask2()
{
for (int i=1;i<=n;i++) cnt[i]=1;
for (int i=1;i<n;i++)
for (int j=i+1;j<=n;j++)
if (a[j]>a[i]) cnt[j]=cnt[i]+1;
cout<<*max_element(cnt+1,cnt+n+1);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin>>n>>k;
for (int i=1;i<=n;i++) cin>>a[i];
subtask2();
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |