제출 #1164644

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1164644		Jawad_Akbar_JJ	Rabbit Carrot (LMIO19_triusis)	C++20	컴파일 에러	0 ms	0 KiB

triusis

#include <iostream>

using namespace std;
int inf = 1e9 + 7;

struct segtree{
	segtree *lc, *rc;
	bool Lc = 0, Rc = 0;
	int Mn = 1e9;

	void Add(int i, int vl, int st = 0, int en = inf){
		if (i >= en or i < st) return;
		// cout<<st<<" "<<en<<" "<<i<<" "<<vl<<'\n';
		if (en - st == 1){
			Mn = vl;
			return;
		}

		if (!Lc){
			lc = new segtree();
			rc = new segtree();
			Lc = Rc = 1;
		}
		lc->Add(i, vl, st, (st + en) / 2);
		rc->Add(i, vl, (st + en) / 2, en);
		Mn = min(lc->Mn, rc->Mn);
	}

	int get(int l, int r, int st = 0, int en = inf){
		if (l <= st and r >= en)
			return Mn;
		if (l >= en or r <= st or Lc == 0)
			return 1e9;
		return min(lc->get(l, r, st, (st + en) / 2), rc->get(l, r, (st + en) / 2, en));
	}
};


int main(){
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	segtree *Seg = new segtree();
	Seg->Add(0, 0);
	// return 0;

	int n, M, a;
	cin>>n>>M;
	int Ans = n;

	for (int i=1;i<=n;i++){
		cin>>a;
		int dp = Seg->get(a - M, inf) + i - 1;
		// cout<<i<<" "<<dp<<'\n';
		Ans = min(Ans, n - i + dp);
		Seg->Add(a, dp - i);
	}
	cout<<Ans<<'\n';

컴파일 시 표준 에러 (stderr) 메시지

triusis.cpp: In function 'int main()':
triusis.cpp:56:25: error: expected '}' at end of input
   56 |         cout<<Ans<<'\n';
      |                         ^
triusis.cpp:39:11: note: to match this '{'
   39 | int main(){
      |           ^