제출 #1055303

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1055303		YassirSalama	Financial Report (JOI21_financial)	C++17	0 / 100	4037 ms	7436 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
signed main(){
    int n,d;
    cin>>n>>d;
    vector<int> v(n);
    for(int i=0;i<n;i++){
        cin>>v[i];
    }
    map<int,int> dp;//ans if max chosen till v[i] was 1
    for(int i=0;i<n;i++){
        map<int,int> c=dp;
        for(auto it=c.begin();it!=c.end();it++){
            pair<int,int> x=*it;
            if(v[i]>x.F){
                dp.erase(x.F);
                dp[v[i]]=max(dp[v[i]],x.S+1);
            }else break;
        }
        dp[v[i]]=max(dp[v[i]],1LL);
    }
    int ans=0;
    for(auto x:dp) ans=max(ans,x.S);
    cout<<ans<<endl;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35