제출 #1239878

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1239878		PlayVoltz	Preokret (COCI19_preokret)	C++20	50 / 50	0 ms	328 KiB

preokret

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, res=1, ans=0;
	cin>>n;
	vector<int> vect(n);
	vector<vector<int> > psum(2, vector<int>(n+1, 0)), p(2, vector<int>(n+1, 0));
	for (int i=1, a; i<=n; ++i)cin>>a, vect[i]=a-1, psum[0][i]=psum[0][i-1], psum[1][i]=psum[1][i-1], ++psum[a-1][i], res+=psum[0][i]==psum[1][i], p[0][i]=p[0][i-1], p[1][i]=p[1][i-1], p[a-1][i]=i;
	for (int i=1; i<=n; ++i)if (psum[vect[i]][p[!vect[i]][i]]<psum[!vect[i]][p[!vect[i]][i]]&&psum[vect[i]][i]>psum[!vect[i]][i])ans=max(ans, i-p[!vect[i]][i]);
	cout<<psum[0][n]<<" "<<psum[1][n]<<"\n"<<res<<"\n"<<ans;
}

• Subtask 1: 50 / 50