제출 #145373

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
145373		dolphingarlic	JOI 문장 (JOI14_ho_t1)	C++14	0 / 100	2 ms	504 KiB

2014_ho_t1

#include <bits/stdc++.h>
#pragma GCC Optimize("O3")
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;

int main() {
    iostream::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> alt_sequences = {0, 0};

    int prev = 0, len = 0;
    FOR(i, 0, n) {
        int curr;
        cin >> curr;
        if (curr == prev) {
            alt_sequences.push_back(len);
            len = 0;
        }
        len++;
        prev = curr;
    }
    alt_sequences.push_back(len);

    int ans = 0;
    FOR(i, 0, alt_sequences.size() - 2)
    ans = max(ans,
              alt_sequences[i] + alt_sequences[i + 1] + alt_sequences[i + 2]);
    cout << ans << '\n';
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

2014_ho_t1.cpp:2:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
 #pragma GCC Optimize("O3")
 
2014_ho_t1.cpp: In function 'int main()':
2014_ho_t1.cpp:3:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define FOR(i, x, y) for (int i = x; i < y; i++)
2014_ho_t1.cpp:29:9:
     FOR(i, 0, alt_sequences.size() - 2)
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  
2014_ho_t1.cpp:29:5: note: in expansion of macro 'FOR'
     FOR(i, 0, alt_sequences.size() - 2)
     ^~~

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70