제출 #701436

#제출 시각아이디문제언어결과실행 시간메모리
701436tamthegod새로운 문제 (POI11_pio)C++17
81 / 100
1046 ms48812 KiB
// Make the best become better // No room for laziness #include<bits/stdc++.h> #define pb push_back #define fi first #define se second using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int maxN = 5e5 + 5; const int mod = 1e9 + 7; const ll oo = 1e18; int n; int a[maxN]; int f[21][maxN]; int lg[maxN]; int ans[maxN]; void SparseTable() { for(int i=1; i<=n; i++) f[0][i] = a[i]; for(int k=1; k<=lg[n]; k++) for(int i=1; i<=n; i++) { int j = i + (1 << (k - 1)); if(j > n) f[k][i] = f[k - 1][i]; else f[k][i] = max(f[k - 1][i], f[k - 1][j]); } } inline int get(int l, int r) { int k = lg[r - l + 1]; return max(f[k][l], f[k][r - (1 << k) + 1]); } void ReadInput() { cin >> n; for(int i=1; i<=n; i++) cin >> a[i]; for(int i=2; i<maxN; i++) lg[i] = lg[i / 2] + 1; } void Solve() { SparseTable(); for(int i=1; i<=n; i++) { int res = ans[i - 1] + a[i - 1] - a[i] - 1; int len = (int)sqrt(i - 2) + 1; while(len >= 1) { int r = i - (len - 1) * (len - 1) - 1; int l = i - len * len; l = max(1, l); if(a[i] + res - len >= get(l, i - 1)) break; res = max(res, get(l, r) + len - a[i]); len--; } len = (int)sqrt(n - i - 1) + 1; while(len >= 1) { int l = i + (len - 1) * (len - 1) + 1; int r = i + len * len; r = min(r, n); if(a[i] + res - len >= get(i + 1, r)) break; res = max(res, get(l, r) + len - a[i]); len--; } cout << (ans[i] = res) << '\n'; } } int32_t main() { //freopen("sol.inp", "r", stdin); ios_base::sync_with_stdio(false); cin.tie(nullptr); ReadInput(); Solve(); }
#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...
#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...