Submission #37448

#TimeUsernameProblemLanguageResultExecution timeMemory
37448KerimMoney (IZhO17_money)C++14
45 / 100
1500 ms92208 KiB
#include "bits/stdc++.h" #define MAXN 1090009 #define INF 1000000007 #define mp(x,y) make_pair(x,y) #define all(v) v.begin(),v.end() #define pb(x) push_back(x) #define wr cout<<"----------------"<<endl; #define ppb() pop_back() #define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++) #define ff first #define ss second #define my_little_dodge 46 #define debug(x) cerr<< #x <<" = "<< x<<endl; using namespace std; typedef long long ll; typedef pair<int,int> PII; template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;} template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;} multiset<int>s; int arr[MAXN]; int main(){ //~ freopen("file.in", "r", stdin); int n; scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",arr+i); int pos=-1; for(int i=1;i<n;i++){ s.insert(arr[i]); if(arr[i]>arr[i+1]){ pos=i+1; break; } } if(pos==-1){ puts("1"); return 0; } int ans=1; while(1){ __typeof((s).begin())it=s.upper_bound(arr[pos]); int right=INF; if(it!=s.end()) right=*it; int now=arr[pos],tmp=pos; ans++; for(int i=pos;i<=n;i++){ s.insert(arr[i]); if(now<=arr[i] and arr[i]<=right) now=arr[i]; else{ pos=i; break; } } if(tmp==pos) break; } printf("%d\n",ans); return 0; }

Compilation message (stderr)

money.cpp: In function 'int main()':
money.cpp:25:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
money.cpp:27:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",arr+i);
                    ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...