제출 #1173453

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1173453		somefolk	Airplane (NOI23_airplane)	C++20	0 / 100	0 ms	324 KiB

Main

#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <cassert>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;

#define endl "\n"
// #define int long long

const int INF = 1e9+7;
const int MOD = 1e9+7;

struct E{
    int u, v;
};

void solve(){
    int n, m;
    cin >> n >> m;
    int mx = -1, mxIdx;
    vector<int> a(n);
    for(int i = 1; i < n-1; i++){
        cin >> a[i];
        if(a[i] > mx){
            mx = a[i];
            mxIdx = i;
        }
    }
    vector<E> edges(m);
    for(int i = 0; i < m; i++){
        cin >> edges[i].u >> edges[i].v;
    }

    if(mx != -1){
        for(int i = 1; i <= mxIdx; i++){
            if(a[i] < a[i-1]) a[i] = a[i-1];
        }
        for(int i = n-2; i >= mxIdx; i--){
            if(a[i] < a[i+1]) a[i] = a[i+1];
        }
    }

    int sol = 0;
    for(int i = 1; i < n; i++){
        if(a[i] == a[i-1]) sol++;
        else sol += abs(a[i] - a[i-1]);
    }
    cout << sol << endl;
}

int32_t main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}

• Subtask 1: 0 / 22
• Subtask 2: 0 / 10
• Subtask 3: 0 / 31
• Subtask 4: 0 / 37