Submission #1164397
Source Code Expand
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <random>
#include <deque>
#define INF_LL 1e18
#define INF 1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
const ll MOD = 1e9+7;
int dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
int dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
template<typename T>
void chmax(T &a, T &b){
a = max(a, b);
}
template<typename T>
void chmin(T &a, T &b){
a = min(a, b);
}
class Union_find{
private:
vector<int> par;
vector<int> rank;
int n;
public:
Union_find(int a){
n = a;
for(int i = 0;i < n;i++){
par.push_back(i);
rank.push_back(0);
}
}
int find(int x){
if(par[x] == x){
return x;
}else{
return par[x] = find(par[x]);
}
}
void unite(int x, int y){
x = find(x);
y = find(y);
if(x == y) return;
if(rank[x] < rank[y]){
par[x] = y;
}else{
par[y] = x;
if(rank[x] == rank[y]) rank[x]++;
}
}
bool same(int x, int y){
return find(x) == find(y);
}
};
class RMQ{
int n;
vector<int> dat;
public:
RMQ(int n_){
n = 1;
while(n < n_) n *= 2;
REP(i, n*2-1){
dat.push_back(INF);
}
}
void update(int x, int i){
i += n-1;
dat[i] = x;
while(i > 0){
i = (i-1)/2;
dat[i] = min(dat[i*2+1], dat[i*2+2]);
}
}
int query(int a, int b, int l, int r, int x){
if(a <= l && r <= b) return dat[x];
if(r <= a || b <= l) return INF;
int res = INF;
res = min(query(a, b, l, (l+r)/2, x*2+1), query(a, b, (l+r)/2, r, x*2+2));
return res;
}
int query(int a, int b){
return query(a, b, 0, n, 0);
}
};
const ll mod = 1e9+7;
int main(void){
int N, K;
int A[314514];
cin >> N >> K;
REP(i, N){
cin >> A[i];
}
int p = 1;
ll res = 0;
FOR(i, 1, N){
if(A[i] > A[i-1]){
p++;
}else{
if(p >= K)
res += p-K+1;
p = 1;
}
}
if(p >= K)
res += p-K+1;
cout << res << endl;
}
Submission Info
Submission Time |
|
Task |
B - 解像度が低い。 |
User |
maze1230 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
2338 Byte |
Status |
AC |
Exec Time |
117 ms |
Memory |
1408 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
decr2_1.txt, decr2_2.txt, decr_1.txt, decr_2.txt, incr2_1.txt, incr2_2.txt, incr2_3.txt, incr_1.txt, incr_2.txt, incr_3.txt, incr_4.txt, incr_5.txt, ins_1.txt, ins_2.txt, ins_3.txt, ins_4.txt, ins_5.txt, ins_6.txt, ins_7.txt, ins_8.txt, ins_9.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt |
Case Name |
Status |
Exec Time |
Memory |
decr2_1.txt |
AC |
13 ms |
384 KB |
decr2_2.txt |
AC |
13 ms |
384 KB |
decr_1.txt |
AC |
12 ms |
384 KB |
decr_2.txt |
AC |
13 ms |
384 KB |
incr2_1.txt |
AC |
40 ms |
640 KB |
incr2_2.txt |
AC |
40 ms |
640 KB |
incr2_3.txt |
AC |
40 ms |
640 KB |
incr_1.txt |
AC |
114 ms |
1408 KB |
incr_2.txt |
AC |
40 ms |
640 KB |
incr_3.txt |
AC |
114 ms |
1408 KB |
incr_4.txt |
AC |
117 ms |
1408 KB |
incr_5.txt |
AC |
115 ms |
1408 KB |
ins_1.txt |
AC |
117 ms |
1408 KB |
ins_2.txt |
AC |
114 ms |
1408 KB |
ins_3.txt |
AC |
115 ms |
1408 KB |
ins_4.txt |
AC |
115 ms |
1408 KB |
ins_5.txt |
AC |
117 ms |
1408 KB |
ins_6.txt |
AC |
116 ms |
1408 KB |
ins_7.txt |
AC |
116 ms |
1408 KB |
ins_8.txt |
AC |
113 ms |
1408 KB |
ins_9.txt |
AC |
117 ms |
1408 KB |
random_1.txt |
AC |
115 ms |
1408 KB |
random_2.txt |
AC |
55 ms |
1408 KB |
random_3.txt |
AC |
116 ms |
1408 KB |
random_4.txt |
AC |
117 ms |
1408 KB |
random_5.txt |
AC |
115 ms |
1408 KB |
sample_1.txt |
AC |
1 ms |
256 KB |
sample_2.txt |
AC |
1 ms |
256 KB |
sample_3.txt |
AC |
1 ms |
256 KB |
sample_4.txt |
AC |
1 ms |
256 KB |