QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#753039#4935. Exchange BottleneckMeatInTheMiddle#WA 0ms3668kbC++17972b2024-11-16 11:03:132024-11-16 11:03:14

Judging History

你现在查看的是最新测评结果

  • [2024-11-16 11:03:14]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3668kb
  • [2024-11-16 11:03:13]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define fastio (ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL))
typedef long long ll;
typedef long double lld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int MAXSIZE = 2000000;
const long long INF = 1e18 + 5;
const double EPSILON = 1e-14;
const ll DIV = 2000003;
const long double pi = 3.14159265358979323846264338327950288419716939937510L;

int n;
int arr[101010];

int main()
{
    fastio;
    int ans = 1;
    cin >> n;
    int cur = 0;
    for (int i = 1; i < n; i++)
    {
        int a;
        cin >> arr[i];
        if (n > 3 && a == 0)
            ans = 2;
    }
    int mx = 0;
    int con = 0;
    for (int i = 1; i < n; i++)
    {
        if (arr[i] == 0)
        {
            con++;
        }
        else
            con = 0;
    }
    if (con == n - 1)
        con--;
    ans = max(ans, con + 1);

    cout << ans;
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3668kb

input:

5
1 0 1 0

output:

2

result:

ok single line: '2'

Test #2:

score: -100
Wrong Answer
time: 0ms
memory: 3592kb

input:

7
1 1 1 1 1 1

output:

2

result:

wrong answer 1st lines differ - expected: '1', found: '2'