CF 797C
• 给定长度为n的小写字母字符串s,及空串t, u,两种操作
• 1. 将s的第一个字符加到t的末尾
• 2. 将t的最后一个字符加到u的末尾
• 求字典序最小的字符串u (长度必须为n,即s, t最后为空串)
• 1 ≤ n ≤ 1e5
这道题骚在 s 是一个队列
t 是一个栈
那么只要你s中最小的字符比栈的元素小于
那么肯定是队列进栈
否则栈去 t 中
/*
if you can't see the repay
Why not just work step by step
rubbish is relaxed
to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0