제출 #394862

#제출 시각아이디문제언어결과실행 시간메모리
394862Qw3rTyRabbit Carrot (LMIO19_triusis)C++11
0 / 100
1 ms332 KiB
#include <iostream> #define int long long #define INF 1e12 using namespace std; const int maxN = 2e5+5; int f[maxN]; int a[maxN]; int N,M; struct node{ int val,lc,rc; node(){}; }tree[maxN<<2]; int cnt; int build(){ tree[++cnt].val = 0; tree[cnt].lc = 0; tree[cnt].rc = 0; return cnt; } void pushup(int p){ tree[p].val = max(tree[tree[p].lc].val,tree[tree[p].rc].val); return; } void update(int p, int l, int r, int a, int b, int val){ if(a > r || b < l)return; if(a <= l && r <= b){ tree[p].val = max(tree[p].val,val); return; } int mid = (l+r)>>1; if(tree[p].lc == 0)tree[p].lc = build(); if(tree[p].rc == 0)tree[p].rc = build(); update(tree[p].lc,l,mid,a,b,val); update(tree[p].rc,mid+1,r,a,b,val); pushup(p); return; } int query(int p, int l, int r, int a, int b){ if(a > r || b < l)return 0; if(a <= l && r <= b)return tree[p].val; int mid = (l+r)>>1; return max(query(tree[p].lc,l,mid,a,b),query(tree[p].rc,mid+1,r,a,b)); } void testIO(){ freopen("../test.in","r",stdin); return; } signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); //testIO(); cin >> N >> M; for(int i = 1; i <= N; ++i)cin >> a[i]; a[0] = 0; f[0] = 0; for(int i = 1; i <= N; ++i){ if(a[i] > M*i)continue; f[i] = max(f[i],query(1,-INF,INF,a[i]-M*i,INF)+1); update(1,-INF,INF,a[i]-M*i,a[i]-M*i,f[i]); } for(int i = 1; i <= N; ++i){ if(a[i] > M*i)continue; for(int j = 0; j < i; ++j){ if(a[i] <= a[j] + M*(i-j))f[i] = max(f[i],f[j]+1); } } int res = 0; for(int i = 1; i <= N; ++i)res = max(res,f[i]); cout << N - res << '\n'; return 0; }

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

triusis.cpp: In function 'void testIO()':
triusis.cpp:53:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   53 |     freopen("../test.in","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...