# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
575375 | 2022-06-10T09:44:06 Z | d4xn | Mountains (IOI17_mountains) | C++17 | 0 ms | 0 KB |
#pragma GCC optimize ("Ofast") #include "mountains.h" #include <bits/stdc++.h> using namespace std; #define ld long double #define ll long long const int N = 2002; ll n, ans; vector<pair<ll, ll>> v, taken; int maximum_deevs(vector<int> y) { n = y.size(); ans = 0; v.resize(n); for(ll i = 0; i < n; i++) { v[i] = make_pair(y[i], i); } sort(v.begin(), v.end()); for(ll i = 0; i < n; i++) { bool ok = 1; for (ll j = 0; j < taken.size()) { // comprobar si se puede coger } if (ok) taken.push_back(make_pair(v[i].second, v[i].first)); } ll sz = taken.size(); return max(sz, 1ll); }