제출 #692547

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
692547		delrey	Preokret (COCI19_preokret)	C++14	50 / 50	1 ms	340 KiB

preokret

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, a;
    cin>>n;
    int goalsCity = 0, goalsOpp = 0, ties = 1, streak = 0, prev = 0, lead = 0, streakMax = 0;
    for(int i = 0; i < n; i++)
    {
        cin>>a;
        if(a == prev)
            streak++;
        else
        {
            streak = 1;
            if(goalsCity > goalsOpp)
                lead = 1;
            else if(goalsCity < goalsOpp)
                lead = 2;
            else
                lead = 0;
        }
        if(a == 1)
            goalsCity++;
        else
            goalsOpp++;
        if(goalsCity > goalsOpp && lead == 2)
            streakMax = max(streak, streakMax);
        if(goalsCity < goalsOpp && lead == 1)
            streakMax = max(streak, streakMax);
        if(goalsCity == goalsOpp)
            ties++;
        prev = a;
    }
    cout<<goalsCity<<" "<<goalsOpp<<endl;
    cout<<ties<<endl;
    cout<<streakMax<<endl;
    return 0;
}

• Subtask 1: 50 / 50