# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
515939 | Joo | Lightning Rod (NOI18_lightningrod) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(void){
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
stack<pair<int, int>> st;
for(int i = 1; i <= n; i++){
int x, y; cin >> x >> y;
while(!st.empty() and x-st.top().first <= y-st.top().second) st.pop;
if(st.empty() or (x-st.top().first > y-st.top().second and x-st.top().first > st.top.second-y)) st.push({x, y});
}
cout << st.size();
return 0;
}