백준 2094 강수량 혼내주기
#include #define fastio ios::sync_with_stdio(0), cin.tie(0) using namespace std; using ll = long long; using pii = pair; using pll = pair; #define all(v) v.begin(), v.end() int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1}; int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1}; const int N = 1 years[i] >> tree[i+N]; for(int i = N-1; i; --i) tree[i] = max(tree[i Y >> X; int ret = solve(Y, X); if(ret == 0) cout
혼내주기
2021. 7. 22. 10:51