제출 #393795

#제출 시각아이디문제언어결과실행 시간메모리
393795Qw3rTyRabbit Carrot (LMIO19_triusis)C++11
0 / 100
1 ms204 KiB
#include <bits/stdc++.h> using namespace std; const int maxN = 2e5+5; int f[maxN]; int a[maxN]; int N,M; 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]; for(int i = 1; i <= N; ++i){ if(a[i] <= a[i-1] + M)f[i] = f[i-1]; else{ int cnt = 0; while(a[i]-M*cnt > a[i-cnt-1])++cnt; f[i] = f[i-1] + cnt; } } cout << f[N] << '\n'; return 0; }

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

triusis.cpp: In function 'void testIO()':
triusis.cpp:11:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   11 |     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...