oj.uz

답안 #887434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887434 2023-12-14T14:24:36 Z 8pete8 Money (IZhO17_money) C++17
0 / 100
 0 ms 2396 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include <cassert>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric> //gcd(a,b)
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
//#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
using namespace std;
#define int long long
#define double long double
const int mod=1e9+7,mxn=1e6+5,lg=20,inf=1e18;
set<int>s;
int val[mxn+10],cnt[mxn+10];
int32_t main(){
    fastio
    int n;cin>>n;
    int ans=0;
    for(int i=1;i<=n;i++)cin>>val[i];
    s.insert(inf);
    bool yes=false;
    for(int i=1;i<=n;i++){
        auto it=s.lb(val[i]);
        while(i<=n&&val[i]<=(*it)&&val[i]>val[i-1]){
            i++;
        }
        ans++;
    }
    cout<<ans;
}

Compilation message

money.cpp: In function 'int32_t main()':
money.cpp:45:10: warning: unused variable 'yes' [-Wunused-variable]
   45 |     bool yes=false;
      |          ^~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -