提出 #24318618

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef pair<string,string> Pstring;
typedef pair<double,double> Pdouble;


#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define Precision13 cout << fixed << setprecision(13)
const double PI=3.14159265358979323846;
const int MAX = 510000;
const int MOD = 1000000007;
const int INF = 1<<29;
using Graph = vector<vector<ll>>;



int main() {

  ll n,k;

  cin>>n>>k;
  vector<ll> c(n+1);

  map<ll,ll> M;

  REP1(i,n){
    cin >> c[i];
    M[c[i]]= 0;
  }

  ll ans = 0;
  for (ll i = 1; i <= k; i++) {
    if(M[c[i]]==0){
      ans++;
    }
    M[c[i]]++;
    
  }

  if(n-k==0){
    cout << ans << endl;
    return 0;
  }

  ll sans = ans;
  ll dans = ans;

  for (ll i = 2; i <= n-k+1; i++) {

    M[c[i-1]]--;

    if(M[c[i-1]]==0){
      dans--;
    }

    M[c[i+k-1]]++;


    if(M[c[i+k-1]]==1){
      dans++;
    }

    sans = max(sans, dans);



  }

  cout << sans << endl;
  
  
}

提出情報

ジャッジ結果