提出 #73492443

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vvvl=vector<vector<vector<long long>>>;
using pl=pair<long long,long long>;
using vpl=vector<pair<long long,long long>>;
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(long long i=(long long)(a);i<(long long)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#include <atcoder/all>
using namespace atcoder;

long long modpow(long long a, long long n, long long mo){long long res=1;while(n>0){if(n&1){res=res*a%mo;}a=a*a%mo;n>>=1;}return res;}
long long Pow(long long a, long long n){long long res=1;while(n>0){if(n&1){res=res*a;}a=a*a;n>>=1;}return res;}
//座標圧縮
template <typename T>
vector<T> compress(vector<T> &X) {
    vector<T> vals = X;
    sort(vals.begin(), vals.end());
    vals.erase(unique(vals.begin(), vals.end()), vals.end());
    for (int i = 0; i < (int)X.size(); i++) {
        X[i] = lower_bound(vals.begin(), vals.end(), X[i]) - vals.begin();
    }
    return vals;
}

const ll MOD=998244353;
const ll INF=(1ll<<60);
int main(){
  ll N;
  cin>>N;
  vl A(N);
  rep(i,N) cin>>A[i];
  auto mem=compress(A);
  vvl C(N);
  rep(i,N){
    C[A[i]].pb(i);
  }
  vvl G(N);
  rep(i,N){
    if(A[i]<mem.size()-1 && mem[A[i]]+1==mem[A[i]+1]){
      auto itr=lb(all(C[A[i]+1]),i);
      if(itr!=C[A[i]+1].end()){
        G[i].pb(*itr);
      }
    }
  }
  vl dp(N,0);
  rep(i,N-1){
    for(ll e:G[i]){
      dp[e]=max(dp[e],dp[i]+1);
    }
  }
  ll ans=0;
  rep(i,N) ans=max(ans,dp[i]+1);
  cout<<ans<<endl;
}

提出情報

コンパイルエラー

./Main.cpp: In function 'int main()':
./Main.cpp:50:12: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     if(A[i]<mem.size()-1 && mem[A[i]]+1==mem[A[i]+1]){

ジャッジ結果