Submission #638368

#	Time	Username	Problem	Language	Result	Execution time	Memory
638368		LeticiaFCS	Financial Report (JOI21_financial)	C++17	0 / 100	4091 ms	20276 KiB

Main

#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;

struct UF {
	vector<int> e, mini;
	UF(int n) : e(n, -1), mini(n) {
		iota(mini.begin(), mini.end(), 0);
	}
	bool same_set(int a, int b) { return find(a) == find(b); }
	int size(int x) { return -e[find(x)]; }
	int find(int x) { return e[x] < 0 ? x : e[x] = find(e[x]); }
	int minimum(int x){ return mini[find(x)]; }
	bool unite(int a, int b) {
		a = find(a), b = find(b);
		if (a == b) return 0;
		if (e[a] > e[b]) swap(a, b);
		e[a] += e[b]; e[b] = a;
		mini[a] = min(mini[a], mini[b]);
		return 1;
	}
};

int main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	int n, d;
	cin>>n>>d;
	UF uf(n+1);
	vector<int> a(n+1);
	vector<int> dp(n+1, -1);
	dp[0] = 0; 
	//dp[i] <-- max se i é o último e i > atrás
	
	map<int,vector<int>> idOfVal;
	for(int i=1; i<=n; i++){
		cin>>a[i];
		idOfVal[a[i]].push_back(i);
	}
	set<int> visited;
	visited.insert(0);
	for(auto &[x, ids]: idOfVal){
		reverse(ids.begin(), ids.end());
		for(int id: ids){
			auto before = visited.upper_bound(id); 
			if(before != visited.begin()){
				before--;
				if(id - (*before) <= d)
					uf.unite(id, *before);
			}
			visited.insert(id);
					
			//cerr<<"id "<<id<<"\n";
			dp[id] = 1;
			
			int l = uf.minimum(id);
			for(int j = id-1; j>=l; j--){
				if(dp[j] != -1){
				//	cerr<<"j "<<j<<"\n";
					dp[id] = max(dp[id], 1 + dp[j]);
				} 
			}
			//cerr<<"dp["<<id<<"] = "<<dp[id]<<"\n";
		}
	}
	cout<<*max_element(dp.begin(), dp.end())<<"\n";
	//j > max before

	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
• Subtask 2: 0 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35