#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int x[N],h[N],n;
int main(void)
{
cin>>n;
for(int i=1;i<=n;i++) cin>>x[i]>>h[i];
if(n<=2) cout<<n;
else
{
int res=2;//第一个左倒,最后一个右倒
for(int i=2;i<=n-1;i++)
{
if(x[i]-h[i]>x[i-1]) res++;//先左倒
else if(x[i]+h[i]<x[i+1])//不行右倒
{
res++;
x[i]+=h[i];
}
}
cout<<res;
}
return 0;
}
C. Woodcutters [greedy]
Guess you like
Origin blog.csdn.net/qq_46527915/article/details/123649491
Recommended
Ranking