Codeforces Round #354 (Div. 2) D
来源:互联网 发布:阿里云西安有拍照 编辑:程序博客网 时间:2024/05/14 13:54
题意:
给你
分析:
首先要注意本题的
容易观察到每次插入节点时,它的父亲节点要么是比它大的数中,距它最近的节点
这里的主要问题是到底是
首先我们应该知道这
这样必定只有两种情况:
1.
2.
用set维护得到
#include <iostream>#include <set>#include <map>using namespace std;map<int, int> le, ri;int n, x;set<int> st;set<int>::iterator r, l;int main() { cin >> n; cin >> x; st.insert(x); for (int i = 0; i < n - 1; i++) { cin >> x; r = st.upper_bound(x); if (r != st.begin()) l = --r, ++r; else l = st.end(); if (r == st.end()) { cout << *l << " "; ri[*l]++; } else if (l == st.end()) { cout << *r << " "; le[*r]++; } else { if (ri.count(*l)) { cout << *r << " "; le[*r]++; } else { cout << *l << " "; ri[*l]++; } } st.insert(x); } cout << endl; return 0;}
0 0
- Codeforces Round #354 (Div. 2) D
- Codeforces Round #354 (Div. 2)676D. Theseus and labyrinth
- Codeforces Round #354 (Div. 2) D. Theseus and labyrinth (BFS)
- Codeforces Round #354 (Div. 2) D. Theseus and labyrinth
- Codeforces Round #354 (Div. 2) D Theseus and labyrinth
- Codeforces Round #354 (Div. 2) D (BFS)
- Codeforces Round #354 (Div. 2) D. Theseus and labyrinth(BFS)
- Codeforces Round #103 (Div. 2) D
- Codeforces Round #104 (Div. 2) D
- Codeforces Round #105 (Div. 2) D
- Codeforces Round #139 (Div. 2) D. Snake
- Codeforces Round #155 (Div. 2) D-rats
- Codeforces Round #159 (Div. 2) D sum
- Codeforces Round #184 (Div. 2) D、E
- Codeforces Round#186(Div 2) D
- codeforces Round # 187(Div.2) D
- Codeforces Round #191 (Div. 2) D
- Codeforces Round #194 (Div. 2) D. Chips
- js操作 cookie
- Android之https(一)
- leetcode.51. N-Queens
- 接口
- 面向对象设计原则
- Codeforces Round #354 (Div. 2) D
- 最长回文子串(Longest Palindromic Substring)
- 线段树 单点更新
- Youtube上下载的Caffe安装视频教程
- 动态规划——scramble-string
- Ubuntu 下完全卸载软件
- 阅读郭林《第一行代码》的笔记——第4章 手机平板要兼顾,探究碎片
- SQL
- IOS 多线程技术