oj.uz

답안 #541164

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
541164 2022-03-22T13:26:45 Z fcw Rabbit Carrot (LMIO19_triusis) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
#define st first
#define nd second
using lint = int64_t;
constexpr int mod = int(1e9) + 7;
constexpr int inf = 0x3f3f3f3f;
constexpr int ninf = 0xcfcfcfcf;
constexpr lint linf = 0x3f3f3f3f3f3f3f3f;
const long double pi = acosl(-1.0);
// Returns -1 if a < b, 0 if a = b and 1 if a > b.
int cmp_double(double a, double b = 0, double eps = 1e-9) {
	return a + eps > b ? b + eps > a ? 0 : 1 : -1;
}
using namespace std;

int main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	//ifstream cin;
	//cin.open("cowjog.in");
	//ofstream cout;
	//cout.open("cowjog.out");
	int n, m;
	cin>>n>>m;
	vector<int>h(n+1);
	for(int i=1;i<=n;i++) cin>>h[i];
	map<int, int>dp;
	dp[0] = 0;
	auto ins = [&](int cur, int val)->void{
		dp[cur] = val;
		auto it = dp.lower_bound(cur);
		while(it != dp.begin() && prev(it)->nd <= val) dp.erase(prev(it));
	};
	for(int i=1;i<=n;i++){
		int cur = h[i] - m*i;
		auto it = dp.lower_bound(cur);
		if(it == dp.end()) continue;
		ins(cur, it->nd + 1);
		dp[cur] = max(dp[cur], it->nd + 1);
	}
	int ans = 0;
	for(auto p : dp) ans = max(ans, p.nd);
	cout<<n - ans<<"\n";
	return 0;
}
/*
[  ]Leu o problema certo???
[  ]Ver se precisa de long long
[  ]Viu o limite dos fors (é n? é m?)
[  ]Tamanho do vetor, será que é 2e5 em vez de 1e5??
[  ]Testar sample
[  ]Testar casos de  borda
[  ]1LL no 1LL << i
[  ]Testar mod (é 1e9+7, mesmo?, será que o mod não ficou negativo?)
*/

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -