http://codeforces.com/problemset/problem/545/C
题意:n棵树,可以砍或不砍,可以倒向左或右;问最多可以看多少棵树;
思路:dp;dp值为当前最大的可以砍的树的数量;dp[i][0]表示不砍,dp[i][1]表示向左倒,dp[i][2]向右倒;向左倒时,上一棵可能可以向右倒;
总结:没开long long,INF没处理到边界!!
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=1e5+9;
const int mod=1e9+7;
template <class T>
inline void sc(T &ret)
{
char c;
ret = 0;
while ((c = getchar()) < '0' || c > '9');
while (c >= '0' && c <= '9')
{
ret = ret * 10 + (c - '0'), c = getchar();
}
}
ll x[maxn],h[maxn],dp[maxn][3];
int main()
{
int n;
while(cin>>n)
{
mem(dp,0);
x[0]=-3e9;
x[n+1]=3e9;
for(int i=1;i<=n;i++)
{
cin>>x[i]>>h[i];
}
for(int i=1;i<=n;i++)
{
dp[i][0]=max(dp[i-1][2],max(dp[i-1][0],dp[i-1][1]));
if(x[i]-h[i]>x[i-1]+h[i-1])
{
dp[i][1]=max(dp[i][1],dp[i-1][2]+1);
dp[i][1]=max(dp[i][1],dp[i-1][1]+1);
dp[i][1]=max(dp[i][1],dp[i-1][0]+1);
}
else if(x[i]-h[i]>x[i-1])
{
dp[i][1]=max(dp[i][1],dp[i-1][0]+1);
dp[i][1]=max(dp[i][1],dp[i-1][1]+1);
}
if(x[i]+h[i]<x[i+1])
{
dp[i][2]=max(dp[i][2],dp[i-1][0]+1);
dp[i][2]=max(dp[i][2],dp[i-1][1]+1);
dp[i][2]=max(dp[i][2],dp[i-1][2]+1);
}
//cout<<dp[i][0]<<" "<<dp[i][1]<<" "<<dp[i][2]<<endl;
}
cout<<max(dp[n][2],max(dp[n][1],dp[n][0]))<<endl;
}
return 0;
}