# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
638747 | jamezzz | Sandcastle 2 (JOI22_ho_t5) | C++17 | 7 ms | 852 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define sf scanf
#define pf printf
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
#define all(x) x.begin(), x.end()
#define lb(x,v) (lower_bound(all(x),v)-x.begin())
#define ub(x,v) (upper_bound(all(x),v)-x.begin())
#define disc(x) sort(all(x));x.resize(unique(all(x))-x.begin());
#define maxn 50005
#define INF 1023456789
int h,w,a[maxn];
int main(){
sf("%d%d",&h,&w);
for(int i=0;i<w;++i){
sf("%d",&a[i]);
}
ll ans=0;int cnt=0;
for(int i=0;i<w;++i){
if(i!=0&&a[i-1]>a[i])cnt=0;
ans+=++cnt;
}
cnt=0;
for(int i=w-1;i>=0;--i){
if(i!=w-1&&a[i+1]>a[i])cnt=0;
ans+=++cnt;
}
ans-=w;
pf("%lld\n",ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |