Submission #920146

#	Time	Username	Problem	Language	Result	Execution time	Memory
920146		Muhammad_Aneeq	Global Warming (CEOI18_glo)	C++17	62 / 100	46 ms	9164 KiB

glo

/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/
 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define int long long
int const N=2e5+10;
int a[N]={};
int n;
inline void solve()
{
    int x;
    cin>>n>>x;
    for (int i=0;i<n;i++)
        cin>>a[i];
    int ans=0;
    vector<int>dp;
    pair<int,int> pre[n+1]={};
    pre[0]={0,-1e9-10};
    for (int i=0;i<n;i++)
    {
        int z=lower_bound(begin(dp),end(dp),a[i])-begin(dp);
        if (z==dp.size())
            dp.push_back(a[i]);
        else
            dp[z]=a[i];
        pre[i+1]={dp.size(),dp.back()};
    }
    for (int i=0;i<n;i++)
        a[i]=-a[i];
    reverse(a,a+n);
    dp={};
    pair<int,int>suf[n+1]={};
    suf[0]={0,-1e9-10};
    for (int i=0;i<n;i++)
    {
        int z=lower_bound(begin(dp),end(dp),a[i])-begin(dp);
        if (z==dp.size())
            dp.push_back(a[i]);
        else
            dp[z]=a[i];
        suf[i+1]={dp.size(),-dp.back()};
    }
    for (int i=0;i<n;i++)
    {  
        if (pre[i].second-suf[n-i].second<x)
            ans=max(ans,pre[i].first+suf[n-i].first);
    }
    cout<<ans<<endl;
}
signed main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}

Compilation message (stderr)

glo.cpp: In function 'void solve()':
glo.cpp:28:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         if (z==dp.size())
      |             ~^~~~~~~~~~~
glo.cpp:43:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         if (z==dp.size())
      |             ~^~~~~~~~~~~

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