Submission #5886798

---

Source Code Expand

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
 
#define _USE_MATH_DEFINES
#define mp       make_pair
#define pb       push_back
#define fst      first
#define snd      second
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};


int main()
{
    int N; cin >> N;
    vi x(N), r(N);
    rep(i,N) cin >> x[i] >> r[i];

    vi dp(N,1);
    rep(i,N) rep(j,i) {
        if(x[i]+r[i] > x[j]+r[j] && x[i]-r[i] < x[j]-r[j])
            dp[i] = max(dp[j]+1,dp[i]);
    }

    int ans = 0;
    rep(i,N)
        ans = max(dp[i], ans);

    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result