# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
375360 | 2021-03-09T10:09:34 Z | muhi1112 | Po (COCI21_po) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define f1 first #define s2 second #define INF 99999999 #define ll long long #define pb push_back #define fri(a) freopen(a,"r",stdin) #define fro(a) freopen(a,"w",stdout) const int N=2e6+5; vector<int>v; set<int>s; ll dizi[N],ans; void solve(){ cin>>n; for(int i=0;i<n;i++){ cin>>dizi[i]; } v.pb(-1); for(int i=1;i<n-1;i++){ if(dizi[i-1]>dizi[i] && dizi[i]<dizi[i+1]){ v.pb(i); } } v.pb(n-1); for(int i=1;i<v.size();i++){ //cout<<v[i]<<endl; for(int j=v[i-1]+1;j<=v[i];j++){ s.insert(dizi[j]); } ans+=s.size(); s.clear(); } cout<<ans<<endl; } int main(){ //fri("in.txt"); //fro("out.txt"); solve(); return 0; }