Submission #3507530
Source Code Expand
#include <bits/stdc++.h>
typedef long long ll;
const ll INF = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible" ) << endl
#define possible(n) cout << ((n) ? "possible" : "impossible" ) << endl
#define SANKOU(n,a,b) cout << ((n) ? (#a) : (#b) ) << endl
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define REP(i,n) for(ll i=0;i<(n);++i)
#define REPR(i,n) for(ll i=n;i>=0;i--)
#define FOREACH(x,a) for(auto&& (x) : (a) )
#define WFA(d,v) REP(k,v)REP(i,v)REP(j,v)d[i][j]=min(d[i][j],d[i][k]+d[k][j])
#define SCOUT(x) cout<<(x)<<" "
#define ENDL cout<<endl
#define VECCIN(x) for(auto&youso_: (x) )cin>>youso_
#define VECIN2(x,y) REP(i,x.size())cin>>x[i]>>y[i]
#define VECCOUT(x) if(1){for(auto tt=x.begin();tt!=x.end();tt++){if(tt!=x.begin())cout<<" ";cout<<(*tt);}cout<<endl;}
#define ALL(obj) (obj).begin(),(obj).end()
#define EXIST(n,x) (find(ALL(n),x)!=n.end())
#define UNIQUE(obj) sort(ALL( obj )); obj.erase(unique(ALL(obj)),obj.end())
#define EN(x) if(1){cout<<#x<<endl;return 0;}
#define COUT(x) cout<<(x)<<endl
void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail){
cin>>head;
CINT(move(tail)...);
}
#define CIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)
template <class T = ll>
T IN(){T x;cin>>x;return (x);}
template <class Head>
void VT(Head head){}
template <class Head,class Seco,class... Tail>
void VT(Head&& head,Seco&& seco,Tail&&... tail){
seco.resize(head);
VT(head,move(tail)...);
}
void VT2(){}
template <class Head,class... Tail>
void VT2(Head&& head,Tail&&... tail){
VECCIN(head);
VT2(move(tail)...);
}
template <class Head>
void VT3(Head&& head){}
template <class Head,class Seco,class... Tail>
void VT3(Head&& head,Seco&& seco,Tail&&... tail){
seco[head]=IN();
VT3(head,move(tail)...);
}
#define VC1(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);VT2(__VA_ARGS__); //aaabbbccc
#define VC2(n,...) V __VA_ARGS__;VT(n,__VA_ARGS__);REP(i,n)VT3(i,__VA_ARGS__); //abcabcabc
// #include <boost/multiprecision/cpp_ll.hpp>
// using namespace boost::multiprecision; // cpp_ll
#define P pair<ll,ll>
#define V vector<ll>
#define M map<ll,ll>
#define S set<ll>
#define pb(a) push_back(a)
#define mp make_pair
signed main(){
CIN(n);VC1(n,a);
int l = 0;
int r = -1;
int ans = 0;
REP(i,n){
if(r < i){
int siz = a[i];
FOR(j,i,n){
if(siz < a[i])
break;
r = j;
}
}
ans = max(ans, r - l);
if(i != n - 1 && a[i] < a[i + 1]){
l = i + 1;
}
}
COUT(ans + 1);
}
Submission Info
Submission Time |
|
Task |
B - 山のデータ |
User |
shibh308 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3114 Byte |
Status |
WA |
Exec Time |
134 ms |
Memory |
2560 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
0 / 30 |
0 / 70 |
Status |
|
|
|
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 |
AC |
1 ms |
256 KB |
subtask1-01.txt |
AC |
1 ms |
256 KB |
subtask1-02.txt |
WA |
1 ms |
256 KB |
subtask1-03.txt |
WA |
1 ms |
256 KB |
subtask1-04.txt |
AC |
1 ms |
256 KB |
subtask1-05.txt |
AC |
1 ms |
256 KB |
subtask1-06.txt |
AC |
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 |
7 ms |
384 KB |
subtask2-02.txt |
WA |
32 ms |
896 KB |
subtask2-03.txt |
WA |
59 ms |
1408 KB |
subtask2-04.txt |
WA |
117 ms |
2560 KB |
subtask2-05.txt |
WA |
117 ms |
2560 KB |
subtask2-06.txt |
WA |
117 ms |
2560 KB |
subtask2-07.txt |
WA |
118 ms |
2560 KB |
subtask2-08.txt |
AC |
118 ms |
2560 KB |
subtask2-09.txt |
WA |
117 ms |
2560 KB |
subtask2-10.txt |
WA |
117 ms |
2560 KB |
subtask2-11.txt |
WA |
117 ms |
2560 KB |
subtask2-12.txt |
WA |
117 ms |
2560 KB |
subtask2-13.txt |
WA |
134 ms |
2560 KB |
subtask2-14.txt |
WA |
117 ms |
2560 KB |
subtask2-15.txt |
WA |
117 ms |
2560 KB |