Submission #205755

#TimeUsernameProblemLanguageResultExecution timeMemory
205755mraronRabbit Carrot (LMIO19_triusis)C++14
100 / 100
49 ms7140 KiB
#include<iostream> #include<vector> #include<map> #include<set> #include<cassert> #include<cassert> #include<unordered_map> #include<unordered_set> #include<functional> #include<queue> #include<stack> #include<cstring> #include<algorithm> #include<cmath> #include<sstream> #include<iomanip> #include<cstdio> #include<cstdlib> #include<numeric> #include<random> #include<chrono> #include<bitset> using namespace std; #define all(x) (x).begin(), (x).end() #define pb push_back #define xx first #define yy second #define sz(x) (int)(x).size() #define gc getchar #define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0) #define mp make_pair #ifndef ONLINE_JUDGE # define LOG(x) (cerr << #x << " = " << (x) << endl) #else # define LOG(x) ((void)0) #endif typedef long long ll; typedef unsigned long long ull; typedef long double ld; const double PI=3.1415926535897932384626433832795; const ll INF = 1LL<<62; const ll MINF = -1LL<<62; template<typename T> T getint() { T val=0; char c; bool neg=false; while((c=gc()) && !(c>='0' && c<='9')) { neg|=c=='-'; } do { val=(val*10)+c-'0'; } while((c=gc()) && (c>='0' && c<='9')); return val*(neg?-1:1); } //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); uniform_int_distribution<int>(0, n-1)(rng) #define int ll main() { IO; int n,m; cin>>n>>m; vector<int> a(n); for(int i=0;i<n;++i) cin>>a[i]; for(int i=0;i<n;++i) a[i]-=(i+1)*m; int ans=0; if(a[0]>0) { a[0]=0; ans++; } vector<int> lis, lis2; for(int i=n-1;i>=1;i--) { if(a[i]<=0) { auto it2=lower_bound(all(lis2), a[i]+1); if(it2==lis2.end()) lis2.pb(a[i]); else *it2=a[i]; } if(a[i]>a[0]) continue ; auto it=lower_bound(all(lis), a[i]+1); if(it==lis.end()) lis.pb(a[i]); else *it=a[i]; } cout<<min(ans+(n-1-sz(lis)), n-sz(lis2))<<"\n"; return 0; }

Compilation message (stderr)

triusis.cpp:68:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...