Submission #1234767

#TimeUsernameProblemLanguageResultExecution timeMemory
1234767mariza송신탑 (IOI22_towers)C++20
14 / 100
256 ms1832 KiB
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll N=1e5;

ll pref[N]={};

void init(int n, vector<int> a) {
    for(ll i=0; i<n; i++){
        if(i>0) pref[i]=pref[i-1];
        if((i>0 && a[i-1]<a[i]) && (i<n-1 && a[i]>a[i+1])) pref[i]++;
    }
}

int max_towers(int l, int r, int d) {
    return max(0ll,pref[r-1]-pref[l])+1;
}
#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...