keepcoral的博客

poj3468线段树区间求和 +区间更新（模板）#include <iostream>#include <algorithm>#include <string.h>#include <stdio.h>#define L o<<1//*2#define R o<<1|1//*2+1#define ll long lo...

Read problems statements in Mandarin Chinese, Russian and Vietnamese as well. You are given an array of N integers. You should support the following queries on this array. 0 L R : Find the minimu...

求区间的最长子序列和这道题我也不是很懂，不过模板在这里了#include <iostream>#include <algorithm>#include <cstdio>#define L o<<1#define R o<<1|1#define cmax(a,b) a>b?a:0//求区间内子序列的最大和//需要比较的是...

链接：https://www.nowcoder.com/acm/contest/106/I来源：牛客网时间限制：C/C++ 2秒，其他语言4秒空间限制：C/C++ 32768K，其他语言65536K 64bit IO Format: %lld题目描述 It’s universally acknowledged that there’re innumerable trees in the camp...