2018 Multi-University Training Contest 5 Glad You Came
题目:http://acm.hdu.edu.cn/showproblem.php?pid=6356
用线段树维护一个最小最大值搞一下可以过:
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#de...
原创
2018-08-06 21:19:47 ·
117 阅读 ·
0 评论