Submission #1346107

#TimeUsernameProblemLanguageResultExecution timeMemory
1346107coderg300711Global Warming (CEOI18_glo)C++20
28 / 100
2095 ms3540 KiB
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pii pair<int,int>
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define pb push_back
#define sz(x) (int)(x).size()
#define rsz resize
#define ass assign
#define F(i,l,r) for(int i=(l);i<(r);++i)
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
//template<typename T> using pqg = priority_queue<T, vector<T>, greater<T>>;
#define each(a,x) for(auto a:x)
#define FOR(i,a) for(int i=0;i<(a);i++)
#define ROF(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define eb emplace_back
#define ft front()
#define V vector

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _print(x); cerr << endl;
#else
#define debug(x)
#endif

void _print(ll t) {cerr << t;}
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(lld t) {cerr << t;}
void _print(double t) {cerr << t;}
void _print(ull t) {cerr << t;}

template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.ff); cerr << ","; _print(p.ss); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}

//const int mod=1e9+7;

int LIS(const V<ll>& a){
  V<ll> tail;
  each(x,a){
    auto it=lower_bound(tail.begin(),tail.end(),x);
    if(it==tail.end())tail.pb(x);
    else *it=x;
  }
  return sz(tail);
}

void solve(){
int n,x;
cin>>n>>x;
V<ll> t(n);
FOR(i,n)cin>>t[i];
int res=0;
FOR(i,n+1){
  V<ll> tmp(n);
  FOR(j,i)tmp[j]=t[j];
  F(j,i,n)tmp[j]=t[j]+x;
  int cur=LIS(tmp);
  res=max(res,cur);
}
cout<<res<<'\n';
}

signed main(){
    ios_base::sync_with_stdio(0);cin.tie(nullptr);
 //   #ifndef ONLINE_JUDGE
   //   freopen("output.txt", "w", stdout);
     // freopen("input.txt", "r", stdin);
    //  freopen("Error.txt", "w", stderr);
    //#endif
        
    int tt=1;
   // cin>>tt;
    while(tt--)solve();

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...