# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
919700 | 2024-02-01T13:27:07 Z | vjudge1 | Airplane (NOI23_airplane) | C++17 | 29 ms | 1884 KB |
/****************************************************************************** Online C++ Compiler. Code, Compile, Run and Debug C++ program online. Write your code in this editor and press "Run" button to compile and execute it. *******************************************************************************/ #include <bits/stdc++.h> using namespace std; int main() { int n,m; cin>>n>>m; int arr[n]; int mx = 0; vector<int> idx; for(int i =0;i<n;i++){ cin>>arr[i]; mx=max(mx,arr[i]); } for(int i =0;i<n;i++)if(arr[i]==mx)idx.push_back(i); int cnt = 0; for(int i = 0;i<idx.size();i++){ if(i==0){ int k = idx[0]; for(int j =1;j<=k;j++)cnt+=max(1,arr[j]-arr[j-1]); } if(i>0)cnt+=idx[i]-idx[i-1]; if(i==idx.size()-1){ for(int j = n-2;j>=idx[i];j--){ cnt+=max(1,arr[j]-arr[j+1]); } } } cout<<cnt<<endl; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 29 ms | 1884 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 344 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 344 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 29 ms | 1884 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |