제출 #1240543

#제출 시각아이디문제언어결과실행 시간메모리
1240543skibidi123Financial Report (JOI21_financial)C++20
5 / 100
108 ms12972 KiB
#include <bits/stdc++.h> #define long long long using namespace std; void init(){ #define task "main" if(fopen(task".INP","r")){ freopen(task".INP","r",stdin); freopen(task".OUT","w",stdout); } ios::sync_with_stdio(false); cin.tie(nullptr); } struct Seg{int n; vector<int>t; Seg(int _n):n(_n),t(4*n+4){} int qry(int i,int l,int r,int L,int R){ if(R<l||r<L) return 0; if(L<=l&&r<=R) return t[i]; int m=(l+r)>>1; return max(qry(i<<1,l,m,L,R),qry(i<<1|1,m+1,r,L,R)); } void upd(int i,int l,int r,int p,int v){ if(l==r){ t[i]=v; return;} int m=(l+r)>>1; if(p<=m) upd(i<<1,l,m,p,v); else upd(i<<1|1,m+1,r,p,v); t[i]=max(t[i<<1],t[i<<1|1]); } }; int main(){ init(); int n,d; cin>>n>>d; vector<int>a(n+1); for(int i=1;i<=n;i++)cin>>a[i]; vector<pair<int,int>>v; for(int i=1;i<=n;i++)v.emplace_back(a[i],i); sort(v.begin(),v.end(),greater<>()); Seg st(n); vector<int>f(n+1), ansv; for(int i=0, j;i<n;i=j){ int val=v[i].first; ansv.clear(); for(j=i;j<n&&v[j].first==val;j++){ int p=v[j].second; int L=p+1<=n? p+1: n+1; int R=min(n,p+d); int best= L<=R? st.qry(1,1,n,L,R):0; f[p]=best+1; ansv.push_back(p); } for(int p:ansv) st.upd(1,1,n,p,f[p]); } int res=0; for(int i=1;i<=n;i++) if(f[i]>res) res=f[i]; cout<<res; return 0; }

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

Main.cpp: In function 'void init()':
Main.cpp:7:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |         freopen(task".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:8:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |         freopen(task".OUT","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...