Submission #209818

#TimeUsernameProblemLanguageResultExecution timeMemory
209818nicolaalexandraZalmoxis (BOI18_zalmoxis)C++14
0 / 100
1098 ms8440 KiB
#include <bits/stdc++.h>
#define DIM 1000010
using namespace std;
int v[DIM];
int n,i,poz,sol,idx,k;
void solve (int val){
    if (val == 1 || sol)
        return;

    if (v[idx] == val-1){
        /// inseamna ca in stanga nu ma mai duc deloc
        idx++;
    } else {
        /// pot sa ma duc
        if (v[idx] > val-1){
            sol = val-1, poz = idx-1;
            return;
        }
        solve (val-1);
    }

    /// acum dreapta
    if (v[idx] == val-1)
        idx++;
    else {
        if (v[idx] > val-1){
            sol = val-1, poz = idx-1;
            return;
        }
        solve (val-1);
    }
}
int main (){

   // ifstream cin ("zalmoxis.in");
   // ofstream cout ("zalmoxis.out");

    cin>>n>>k;
    for (i=1;i<=n;i++)
        cin>>v[i];

    idx = 1;
    solve (30);

    for (i=1;i<=n;i++){
        cout<<v[i]<<" ";
        if (i == poz)
            cout<<sol<<" ";
    }

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