{"blog_url":"https://logfiles.hatenablog.com/","categories":["UVa"],"version":"1.0","height":"190","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Flogfiles.hatenablog.com%2Fentry%2F20140904%2F1409832007\" title=\"UVa11995 I Can Guess the Data Structure! - Logfiles\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","author_name":"moistx","published":"2014-09-04 21:00:07","description":"\u89e3\u6cd5 \u5404\u30c7\u30fc\u30bf\u69cb\u9020\u306e\u5b9f\u969b\u306e pop \u306e\u51fa\u529b\u3068\u3001\u5165\u529b\u306e\u51fa\u529b\u3068\u3092\u6bd4\u8f03\u3059\u308b\u3002 push \u3057\u3066\u3044\u306a\u3044\u306e\u306b pop \u3057\u3066\u3044\u308b\u5165\u529b\u306b\u3088\u308b impossible \u306b\u6ce8\u610f\u3002 #include <bits/stdc++.h> using namespace std; int main() { int N; while(cin >> N) { queue<int> q; stack<int> stk; priority_queue<int> pq; vector<int> vq, vs, vp, vout; bool impossible = false; for(int i=0; i<N; i++) { int\u2026","image_url":null,"width":"100%","title":"UVa11995 I Can Guess the Data Structure!","provider_url":"https://hatena.blog","url":"https://logfiles.hatenablog.com/entry/20140904/1409832007","type":"rich","author_url":"https://blog.hatena.ne.jp/moistx/","blog_title":"Logfiles"}