제출 #1238681

#제출 시각아이디문제언어결과실행 시간메모리
1238681JerBouquet (EGOI24_bouquet)C++20
28 / 100
3095 ms2352 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 5; int l[MAXN], r[MAXN]; int n; int dp[MAXN]; int main() { scanf("%d", &n); for (int i = 0; i < n; i++) scanf("%d%d", &l[i], &r[i]); dp[0] = 1; int ma; for (int i = 1; i < n; ++i) { ma = 0; for (int j = 0; j < i; ++j) if (j < i - l[i] and i > j + r[j]) ma = max(ma, dp[j]); dp[i] = 1 + ma; } ma = 0; for (int i = 0; i < n; ++i) ma = max(ma, dp[i]); printf("%d\n", ma); return 0; }

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

Main.cpp: In function 'int main()':
Main.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
Main.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%d%d", &l[i], &r[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...
#Verdict Execution timeMemoryGrader output
Fetching results...