제출 #482353

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
482353		Blistering_Barnacles	Global Warming (CEOI18_glo)	C++11	0 / 100	590 ms	56460 KiB

glo

//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q,  dp1[555555] , dp2[555555] , a[555555] , tree[1000005], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
void update(ll s , ll e , ll node , ll idx , ll val){
    if(s > idx || e < idx)R ;
    if(s == e){
        tree[node] = max(tree[node] , val) ;
        R ;
    }
    update(s , md , lx , idx , val) , update(md + 1 , e , rx , idx , val) ;
    tree[node] = max(tree[lx] , tree[rx]) ;
}
ll query(ll s , ll e , ll node , ll l , ll r){
    if(s > r || e < l || l > r)R 0 ;
    if(l <= s && e <= r)R tree[node] ;
    R max(query(md + 1 , e , rx , l , r) , query(s , md , lx , l , r)) ;
}
void solve(){
    set < ll > v ;
    cin >> n >> k ;
    for(ll i = 1 ; i <= n ; i++){
        cin >> a[i] ;
        v.insert(a[i]) ;
        v.insert(a[i] - k + 1) ;
    }
    m = 0 ;
    for(auto u : v){
        mp[u] = ++m ;
    }
    ll ans = 0 ;
    for(ll i = 1 ; i <= n ; i++){
        dp1[i] = query(1 , m , 1 , 1 , mp[a[i]] - 1) + 1 ;
        update(1 , m , 1 , mp[a[i]] , dp1[i]) ;
        ans = max(ans , dp1[i]) ;
    }
    cout << ans << endl ;
}
int main(){
    fast ;
    q = 1 ;
    //cin >> q ;
    while(q--){
        solve() ;
    }
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 17
• Subtask 7: 0 / 25