제출 #234829

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
234829		doowey	Nivelle (COCI20_nivelle)	C++14	110 / 110	40 ms	632 KiB

nivelle

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int AL = 26;
int las[AL];

struct F{
  int A;
  int B;
  int li;
  int ri;
  bool operator< ( const F &C) const {
    return A * C.B < C.A * B;
  }
};

int main(){
  fastIO;
  int n;
  cin >> n;
  for(int i = 0 ; i < AL; i ++ ){
    las[i]=-1;
  }
  F cur = {1, 1, 1, 1};
  char in;
  int d;
  set<int> pos;
  pos.insert(0);
  int cnt;
  for(int i = 1; i <= n; i ++){
    cin >> in;
    d = in - 'a';
    if(las[d] != -1){
      pos.erase(las[d]);
    }
    pos.insert(i);
    auto it = pos.end();
    it--;
    cnt = 0;
    F tri;
    while(it != pos.begin()){
      auto pv = it;
      pv -- ;
      cnt ++ ;
      tri = {cnt, i - (*pv), (*pv) + 1, i};
      cur = min(cur, tri);
      it = pv;
    }
    las[d]=i;
  }
  cout << cur.li << " " << cur.ri << "\n";
  return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 17 / 17
• Subtask 3: 13 / 13
• Subtask 4: 25 / 25
• Subtask 5: 48 / 48