제출 #1292062

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1292062		cnam9	Preokret (COCI19_preokret)	C++20	50 / 50	1 ms	352 KiB

preokret

#include <iostream>

using namespace std;


signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    
    int n;
    cin >> n;
    
    int goals1 = 0;
    int goals2 = 0;
    int delta = 0;
    int j = 0;
    int lastgoal = 0;
    int lastdelta = 0;
    int numties = 1;
    int maxturnover = 0;
    
    for (int i = 1; i <= n; i++) {
        int t;
        cin >> t;
        
        if (t == 1) {
            goals1++;
            delta++;
            
            if (lastgoal == 1) {
                if (lastdelta <= 0 && delta > 0)
                    maxturnover = max(maxturnover, i - j + 1);
            } else {
                j = i;
                lastgoal = 1;
                lastdelta = delta;
            }
        } else {
            goals2++;
            delta--;
            
            if (lastgoal == 2) {
                if (lastdelta >= 0 && delta < 0)
                    maxturnover = max(maxturnover, i - j + 1);
            } else {
                j = i;
                lastgoal = 2;
                lastdelta = delta;
            }
        }
        
        numties += !delta;
    }
    
    cout << goals1 << ' ' << goals2 << '\n';
    cout << numties << '\n';
    cout << maxturnover;
    
    return 0;
}

• Subtask 1: 50 / 50