#include <iostream>
#include <string>
#include <map>
#include <cstdlib>
using namespace std;void parse(const string& srcStr,  map<string, string>& mapTable)
{if (srcStr.empty()) return ;wcout.imbue(locale("chs")) ; //设置编码方式，能够输出unicodeint p0 = 0, p1 = 0, p2 = 0 ;while(p0 != string :: npos && p0 < srcStr.length()){p1 = srcStr.find_first_of("#&", p0) ;if (p1 == string :: npos){cout << srcStr.substr(p0, srcStr.length() - p0) ; //一个普通字符串return ;}else{cout << srcStr.substr(p0, p1 - p0) ;//一个普通字符串
p2 = srcStr.find_first_of(";", p1) ;if (p2 == string :: npos){cout << "Bad format" << endl;return ;}string inStr = srcStr.substr(p1, p2 - p1 + 1) ;if (inStr.length() >= 2 && inStr.at(1) == '#') //是一个UNICODE
            {int uniNum = atoi(inStr.substr(2, inStr.length() - 2).c_str()) ;wcout << wchar_t(uniNum) ;}else //是一个普通的转义字符
            {string tmpStr = mapTable[inStr] ;cout << tmpStr ;}p0 = p2 + 1;}}cout << endl;
}int main(int argc, char** argv)
{string src ;cin >> src ;map<string , string > mapTable ;mapTable["""] = "\"" ;mapTable["&"] = "&" ;mapTable["<"] = "<" ;mapTable[">"] = ">" ;parse(src, mapTable) ;return 0 ;
}

#include <iostream>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <algorithm>
using namespace std ;unsigned int nextSeq(unsigned int seq)
{//抽取每一个数字vector<char> digits ;unsigned int preSeq = seq ;while(preSeq){digits.push_back(preSeq % 10) ;preSeq /= 10 ;}reverse(digits.begin(), digits.end()) ;int k = digits.size() - 1 ;while(k > 0 && digits.at(k - 1) > digits.at(k)) --k ;if (k > 0) -- k ;elsereturn seq ; //没有下一个序列返回自身//交换digits[k]和ddigits[q]的值int q = digits.size() - 1 ;while (digits.at(q) < digits.at(k)) --q ;swap(digits.at(k), digits.at(q)) ;//剩下的字符从小到大排序，这里使用bitmap的思想排序(并没有真正用bitmap)int leftNum = digits.size() - k - 1 ;bool *isUsed = new bool[digits.size()] ;memset(isUsed, 0 , digits.size()) ;for (int i = 0; i <= k ; ++ i)isUsed[digits.at(i) - 1] = true ;for(int i = 0; i < digits.size(); ++ i)if (!isUsed[i]) digits.at(++k) = i + 1 ;delete[] isUsed ;//计算下一个序列的数值int ret = 0 ;for (int i = 0; i < digits.size(); ++ i){ret *= 10 ;ret  += digits.at(i) ;}return ret ;
}int main(int argc, char ** argv)
{int inNum ;while (cin >> inNum){cout << nextSeq(inNum) << endl;}return 0 ;
}

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std ;typedef struct node
{int index ;int heighe ;node(int i = -1 , int h = 0) : index(i), heighe(h){};
}Node ;
int maxArea(vector<int>& histogram)
{int ret = 0;if (histogram.empty()) return 0 ;histogram.push_back(-1) ;Node *tmpStack = new Node[histogram.size() + 1] ;tmpStack[0] = Node(-1, 0) ;int stackIndex = 1 ;for (int i = 0; i < histogram.size();){if (tmpStack[stackIndex - 1].heighe <= histogram[i]){tmpStack[stackIndex ++] = Node(i, histogram[i]) ;++i ;}else{if (stackIndex == 1 && i == histogram.size() - 1) break ; //已经处理完所有的直方图int tmpArea = (i - tmpStack[stackIndex -2].index - 1) * tmpStack[stackIndex - 1].heighe ;ret = max(ret, tmpArea) ;stackIndex -- ; //出栈操作
        }}delete[] tmpStack ;return ret ;
}
int main(int argc, char** argv)
{int values[] = { 2, 1, 4, 5, 1, 3, 3, 1, 2} ;vector<int> tmp(values, values + sizeof(values) / sizeof(int))  ;cout << maxArea(tmp) << endl;return 0 ;
}