lickelon.log

문제 링크 : boj.kr/17410난이도 : D5태그 : 제곱근 분할법, 누적합코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector arr(n); for(auto &e : arr) cin >> e; int s = sqrt(n); vector> bucket(n/s+1)..

문제 링크 : boj.kr/14504난이도 : D5태그 : 제곱근 분할법코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector arr(n); for(auto &e : arr) cin >> e; int s = sqrt(n); vector> bucket(n/s+1); ..