제출 #1090783

#제출 시각아이디문제언어결과실행 시간메모리
1090783yellowtoadInfinite Race (EGOI24_infiniterace2)C++17
100 / 100
48 ms2604 KiB
#include <iostream>
using namespace std;

int m, n, x, maxx, a[200010];

int main() {
    cin >> m >> n;
    for (int i = 1; i <= n; i++) {
        cin >> x;
        if (x > 0) {
            if (a[x] == maxx) a[x] = ++maxx;
            else a[x] = maxx;
        } else if (a[-x] != 0) a[-x]--;
    }
    cout << max(0,maxx-1) << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...