Submission #2522500


Source Code Expand

#include <iostream>
#include <stdio.h>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>
#include <math.h>
#include <iomanip>
#include <vector>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define Sort(a) sort(a.begin(),a.end())
int main(){
    int N;
    cin>>N;
    vector<ll>a(N);
    vector<bool>updown;
    vector<int>change;
   // change.push_back(0);
    //bool last_up=true;
    //updown.push_back(true);
    rep(i,N){
        cin>>a[i];
        if(i!=0){updown.push_back((a[i]-a[i-1])>0);}
    }
   // updown.push_back(false);
     rep(i,updown.size()){
        cout<<updown[i]<<" ";
    }
    cout<<endl;
    change.push_back(0);
    
    rep(i,updown.size()){
        if(i!=0){
            if(!updown[i-1]&&updown[i]){
                change.push_back(i);
            }
        }
    }
    change.push_back(N);
    int ans=-2189284;
    /////
    rep(i,change.size()){
        cout<<change[i]<<" ";
    }
    cout<<endl;
    /////
    rep(i,change.size()){
        if(i!=0){
            ans=max(ans,change[i]-change[i-1]);
        }
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Submission Time
Task B - 山のデータ
User rayhotate
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1197 Byte
Status WA
Exec Time 155 ms
Memory 4412 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
WA × 2
WA × 17
WA × 32
Set Name Test Cases
Sample subtask0-sample-01.txt, subtask0-sample-02.txt
Subtask1 subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt
Subtask2 subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt
Case Name Status Exec Time Memory
subtask0-sample-01.txt WA 1 ms 256 KB
subtask0-sample-02.txt WA 1 ms 256 KB
subtask1-01.txt WA 1 ms 256 KB
subtask1-02.txt WA 1 ms 256 KB
subtask1-03.txt WA 1 ms 256 KB
subtask1-04.txt WA 1 ms 256 KB
subtask1-05.txt WA 1 ms 256 KB
subtask1-06.txt WA 1 ms 256 KB
subtask1-07.txt WA 1 ms 256 KB
subtask1-08.txt WA 1 ms 256 KB
subtask1-09.txt WA 1 ms 256 KB
subtask1-10.txt WA 1 ms 256 KB
subtask1-11.txt WA 1 ms 256 KB
subtask1-12.txt WA 1 ms 256 KB
subtask1-13.txt WA 1 ms 256 KB
subtask1-14.txt WA 1 ms 256 KB
subtask1-15.txt WA 1 ms 256 KB
subtask2-01.txt WA 9 ms 512 KB
subtask2-02.txt WA 42 ms 1408 KB
subtask2-03.txt WA 74 ms 2048 KB
subtask2-04.txt WA 140 ms 3328 KB
subtask2-05.txt WA 139 ms 3328 KB
subtask2-06.txt WA 141 ms 3328 KB
subtask2-07.txt WA 153 ms 4412 KB
subtask2-08.txt WA 139 ms 3328 KB
subtask2-09.txt WA 141 ms 3328 KB
subtask2-10.txt WA 140 ms 3328 KB
subtask2-11.txt WA 154 ms 4412 KB
subtask2-12.txt WA 141 ms 3328 KB
subtask2-13.txt WA 153 ms 4412 KB
subtask2-14.txt WA 139 ms 3328 KB
subtask2-15.txt WA 155 ms 4412 KB