#include <bits/stdc++.h> using namespace std; const int N = 100010; int ma[N]; you are with [N]; int l[N]; int r[N]; int block; int num; void build() { block = sqrt(n); num = n / block; if(n % block){ num++; } for(int i = 1; i <= num; i ++){ l[i] = (i - 1) * block + 1; r[i] = i * block; } r[num] = n; for(int i = 1; i <= n; i ++){ bl[i] = (i - 1) / block + 1; } } intmain() { while(scanf("%d%d", &n, &m) == 2){ for(int i = 0; i < n; i ++){ scanf("%d", &ma[i]); } } }
[Template] - Chunked
Guess you like
Origin http://43.154.161.224:23101/article/api/json?id=325559962&siteId=291194637
Recommended
Ranking