제출 #567785

#제출 시각아이디문제언어결과실행 시간메모리
567785BaytoroGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++17
100 / 100
28 ms6992 KiB
#include <bits/stdc++.h> using namespace std; #define Baytoro_Mayrambekov void solve() #define ios ios::sync_with_stdio(false); cin.tie(NULL); #define pb push_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define fr first #define sc second #define int long long #define endl '\n' const int INF=1e18; void fopn(string name){ freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout); } int binpow(int a,int n){ if(n==0) return 1; if(n%2==1) return binpow(a, n-1)*a; else{ int b=binpow(a, n/2); return b*b; } } int a,b,c,n,m,i,j,k,x,y,cnt=0,sum=0,res=0; Baytoro_Mayrambekov{ cin>>n; vector<int> vec(n+2),pref(n+2),suf(n+2); vec[0]=-INF; vec[n+1]=-INF; for(i=1;i<=n;i++){ cin>>vec[i]; } for(i=1;i<=n;i++){ pref[i]=pref[i-1]+max(vec[i-1]-vec[i]+1,0ll); } for(i=n;i>0;i--){ suf[i]=suf[i+1]+max(vec[i+1]-vec[i]+1,0ll); } res=1e18; for(i=1;i<=n;i++) res=min(res,max(pref[i],suf[i])); cout<<res<<endl; } main(){ ios; int T=1; //cin>>T; while(T--){ solve(); } }

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

Main.cpp:47:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   47 | main(){
      | ^~~~
Main.cpp: In function 'void fopn(std::string)':
Main.cpp:14:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:15:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...