Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //#include "pch.h"
- #include <iostream>
- #include <vector>
- #include <string>
- #include <sstream>
- using namespace std;
- #define ll long long
- double sqr(double x) {
- return (x * x);
- }
- ostream & operator << (ostream & out, vector<ll> & v) {
- for (int i = 0; i < v.size(); i++) {
- out << v[i] << ' ';
- }
- return out;
- }
- istream & operator >> (istream & in, vector<ll> & v) {
- v.clear();
- string s;
- getline(cin, s);
- istringstream stream(s);
- int a;
- while (stream >> a)
- v.push_back(a);
- return in;
- }
- pair<ll, ll> maxF(vector<ll> & v) {
- int mx = -10000;
- int k = -1;
- for (int i = 0; i < v.size(); i++) {
- if (v[i] > mx | i == 0) {
- k = i;
- mx = v[i];
- }
- }
- if (k != -1) return make_pair(mx, k);
- }
- ll findF(vector<ll> &v, ll x) {
- for (ll i = 0; i < v.size(); i++) {
- if (v[i] == x) return i;
- }
- return -1;
- }
- int main()
- {
- /*
- vector < ll > test = {3, 2 ,1};
- cout << maxF(test).first;
- */
- ll n, mx, mx1, ma, pob, pobpos;
- mx = 5;
- mx1 = 5;
- pob = -1;
- pobpos = -1;
- bool mbx = false;
- vector<ll> m;
- cin >> n;
- for (ll i = 0; i < n; i++) {
- ll x;
- cin >> x;
- if (i == 0 | x > pob) {
- pob = x;
- pobpos = i;
- }
- m.push_back(x);
- }
- for (ll i = pobpos + 1; i < n; i++) {
- ll x;
- x = m[i];
- if (mx1 % 10 == 5 & x < mx1 & (mx1 > mx | !mbx) & i != pobpos + 1) {
- mbx = true;
- mx = mx1;
- }
- mx1 = x;
- }
- if (mbx) {
- ll k = 1;
- for (ll i = 0; i < n; i++) {
- ll x = m[i];
- if (x > mx) {
- k++;
- }
- }
- cout << k;
- }
- else cout << 0;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement