| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 772533 | vjudge1 | Rabbit Carrot (LMIO19_triusis) | C++17 | 23 ms | 8380 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
long long n,m,k,p=1e9+7;
long long power(long long a,long long b){
if(b==0)return 1;
long long ans=power(a,b/2);
ans*=ans;
ans%=p;
if(b%2)ans*=a;
ans%=p;
return ans;
}
long long f(vector<long long>&a){
vector<long long>lis;
for(auto i:a){
int it=upper_bound(lis.begin(),lis.end(),i)-lis.begin();
if(it==lis.size())lis.push_back(i);
else lis[it]=i;
}
return lis.size();
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int T=1;
// cin>>T;
while(T--){
cin>>n>>m;
vector<long long>a(n),b;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=1;i<=n;i++){
if(i*m>=a[i-1]){
b.push_back(i*m-a[i-1]);
}
}
long long ans=n-f(b);
cout<<ans<<'\n';
}
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
