模板

太懒，于是就有了这个博客

板子

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef signed uns;
typedef double dob;
typedef unsigned long long ull;

#define pir(a, b) pair < a, b >
#define MP(a, b) map < a, b >
#define UMP(a, b) unordered_map <a , b>
#define stk(a) stack < a >
#define vct(a) vector <a>
#define PQMIN(a) priority_queue <a,vct(a) ,greater<a> >
#define PQMAX(a) priority_queue <a,vct(a) ,less<a> >
#define mabs(a) ((a) < 0 ? (-(a)) : (a))
#define foo(a, b, k, i) for(int i = (a); i <= (b); i += (k))
#define temT template <typename T >

#define fis first
#define sed second
#define mkp make_pair
#define NPN next_permutation
#define src struct

#define intmx INT_MAX
#define intmn INT_MIN
#define lmx LONG_LONG_MAX
#define lmn LONG_LONG_MIN

//const int mod = ;
//const int MAXN = ;
//const int MAXM = ;

temT T emx(T *a, int l ,int r) {T maxx = intmn; foo(l, r, 1, i){maxx = max(maxx, a[i]); } return maxx;}
temT T emn(T *a, int l ,int r) {T minn = intmx; foo(l, r, 1, i){minn = min(minn, a[i]); } return minn;}
temT void mst(T *a, int n, T iakcsp) {foo(0, n, 1, i) {a[i] = iakcsp;} }
////////////////////////////////////////////////////////////////////////////////////

int main() {



	return 0;
}