제출 #497941

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
497941		tmn2005	Money (IZhO17_money)	C++17	0 / 100	1 ms	204 KiB

money

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_back

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,x,y,l,r,o,ans,res,ok,mx,mn = INF;
int a[N],b,c;

bool get(set<int>&s, int i){
	auto l = s.upper_bound(a[i]);
	l--;
	if(a[i-1] == *l)ret true;
	else false;
}
main(){
	NeedForSpeed
    cin>>n;
    for(int i=1; i<=n; i++){
    	cin>>a[i];
	}
	set<int>s;
	s.ins(INF);
	s.ins(0);
	
	for(int i=1; i<=n; i++){		
		res++;
		s.ins(a[i]);
		while(a[i] < a[i+1] && get(s, i+1) && i < n){
			i++;
			s.ins(a[i]);
		}
		
	}
	cout<<res;




	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

money.cpp: In function 'bool get(std::set<long long int>&, long long int)':
money.cpp:38:12: warning: statement has no effect [-Wunused-value]
   38 |  else false;
      |            ^
money.cpp: At global scope:
money.cpp:40:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   40 | main(){
      | ^~~~
money.cpp: In function 'bool get(std::set<long long int>&, long long int)':
money.cpp:39:1: warning: control reaches end of non-void function [-Wreturn-type]
   39 | }
      | ^

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 20
• Subtask 4: 0 / 55