QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#453649#8781. Element-Wise ComparisonUSP_USP_USPWA 0ms3600kbC++141.3kb2024-06-24 06:11:372024-06-24 06:11:37

Judging History

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

  • [2024-06-24 06:11:37]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3600kb
  • [2024-06-24 06:11:37]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
void dbg_out() { cerr << endl; }
template <typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }
using ll = long long;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MAXN = 2e5 + 5;
const int MOD = 1e9+7; //998244353;
const int INF = 0x3f3f3f3f;
const ll INF64 = ll(4e18) + 5;

void solve(){
	int n;
	cin >> n;
	int m;
	cin >> m;
	vector<int> a(n);
	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	int ans = 0;
	vector<int> dp(n+1);
	for(int i = n-2; i >= 0; i--){
		for(int j = i+1; j < n; j++){
			if(a[i] < a[j]){
				dp[j] = dp[j+1]+1;
			}else{
				if(dp[j] >= m){
					ans += dp[j]-m+1;
				}
				dp[j] = 0;
			}
		}
	}
	for(int i = 0; i < n; i++){
		if(dp[i] >= m){
			ans += dp[i]-m+1;
		}
	}
	cout << ans << '\n';
}

signed main(){

    ios::sync_with_stdio(false); cin.tie(NULL);

    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }

    return 0;
}

/*
Makefile:
CXXFLAGS=-Wall -Wextra -Wshadow -g -pedantic -fsanitize=address,undefined -D_GLIBCXX_DEBUG -D_GLIBCXX_DEBUGPEDANTIC -std=gnu++17
*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

5 3
5 2 1 3 4

output:

0

result:

ok answer is '0'

Test #2:

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

input:

5 2
3 1 4 2 5

output:

3

result:

wrong answer expected '2', found '3'