今天的北宅依旧没有回家

原题链接同机房的用了各种奇怪的算法 听到我一脸懵逼 这题就是 先把公用的最小的建起来 然后上升的肯定是要新建的 答案加上与当前高度的差 后面下降的不用管 在之前建高的时候肯定放上了#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cstdlib>#include<cli

原题链接水了个70 就是正常模拟+取模 多取几个模数#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cstdlib>#include<climits>#include<queue>#include<vector>#include<ctime>#define LL lon

原题链接千本樱(せんぼんざくら)　夜(よる)ニ纷(まぎ)レ 君(きみ)ノ声(こえ)モ　届(とど)カナイヨ 此处(ここ)は宴(うたげ)　钢(はがね)の槛(おり) その断头台(だんとうだい)を　飞(と)び降(お)りて#include<iostream>#include<cstring>#include<algorithm>#include<cstdio>#include<cmath>#

原题链接折叠时 做好对应#include<iostream>#include<cstring>#include<algorithm>#include<cstdio>#include<queue>#include<vector>#include<climits>#include<string>#include<cstdlib>#include<ctime>#define MOD

原题链接简单粗暴 模拟大法好还以为会超时 但是 毕竟只是个第一题#include<iostream>#include<cstring>#include<algorithm>#include<cstdio>#include<queue>#include<vector>#include<climits>#include<string>#include<cstdlib>#inclu

原题链接听说正解是DP#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cstdlib>#include<climits>#include<queue>#include<vector>#include<ctime>using namespace std;int n,i,cnt