Submission #1294314

#TimeUsernameProblemLanguageResultExecution timeMemory
1294314chaitanyamehtaAirplane (NOI23_airplane)C++20
0 / 100
29 ms1972 KiB
#include<bits/stdc++.h>
using namespace std;

#define int long long
vector<vector<pair<int ,int>>> g;

signed main(){
    int n ,m;
    cin>>n>>m;
    vector<int> a(n + 1);
    for(int i =1;i<=n;i++)cin>>a[i];
    int idx =0, alt = 0 , ans = 0;
    for(int i = 1 ; i<=n;i++){
        if(a[i] > alt){
            ans += (i - idx);
            ans += max(0LL , abs(a[i] - a[idx]) - (i - idx));
            idx = i;
            alt = a[i];
        }
    }
            ans += (n - idx);
            ans += max(0LL , abs(a[n] - a[idx]) - (n - idx));
    cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...