結果
問題 | No.2218 Multiple LIS |
ユーザー |
![]() |
提出日時 | 2023-02-17 22:44:10 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,996 bytes |
コンパイル時間 | 1,186 ms |
コンパイル使用メモリ | 126,884 KB |
最終ジャッジ日時 | 2025-02-10 17:41:12 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 38 TLE * 1 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:94:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 94 | scanf("%d", &n); | ~~~~~^~~~~~~~~~ main.cpp:96:20: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 96 | rep(i, n) scanf("%d", &a[i]); | ~~~~~^~~~~~~~~~~~~
ソースコード
// #include <bits/stdc++.h>#include <string.h>#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <chrono>#include <ciso646>#include <climits>#include <cmath>#include <complex>#include <cstdio>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <numeric>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>#define For(i, a, b) for (int i = (int)(a); (i) < (int)(b); ++(i))#define rFor(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); --(i))#define rep(i, n) For(i, 0, n)#define rrep(i, n) rFor(i, n, 0)#define fi first#define se second#include <algorithm>#include <cassert>#include <vector>namespace rklib {template <class T>bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}template <class T>bool chmin(T &a, const T &b) {if (a > b) {a = b;return true;}return false;}template <class T>bool chmin_non_negative(T &a, const T &b) {if (a < 0 || a > b) {a = b;return true;}return false;}template <class T>T div_floor(T a, T b) {if (b < 0) a *= -1, b *= -1;return a >= 0 ? a / b : (a + 1) / b - 1;}template <class T>T div_ceil(T a, T b) {if (b < 0) a *= -1, b *= -1;return a > 0 ? (a - 1) / b + 1 : a / b;}} // namespace rklibusing namespace std;using namespace rklib;using lint = long long;using pii = pair<int, int>;using pll = pair<lint, lint>;int main() {int n;scanf("%d", &n);int a[n];rep(i, n) scanf("%d", &a[i]);constexpr int MAX = 100'010;int dp[MAX];memset(dp, 0, sizeof(dp));rep(i, n) {++dp[a[i]];for (int k = 2; k * a[i] < MAX; ++k) {chmax(dp[k * a[i]], dp[a[i]]);}}printf("%d\n", *max_element(dp, dp + MAX));}