---
title: "Discussion on \"2025春训第二十八场\" | Hashnode"
description: "Discussion on \"2025春训第二十八场\". A. 评估\n关键在于 \\(|a_i| \\le 1000\\)，所以可以开一个长度为 2000 的数组统计一下每个值的个数，然后 \\(\\Theta(n^2)\\) 处理这个 2000 的数组。\n#include <iostream>\n\nusing namespace std;\n\nconst int N = 2010;\nint a[N];\n\nint main() {\n    int n;\n    scanf(\"%d\", &n);\n    for (int i = 1; i <= n; ++i) {\n  ..."
url: "https://hashnode.com/posts/2025st28/684552295700bcb054a112bb"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [2025春训第二十八场](https://invalidname.hashnode.dev/2025st28?utm_source=hashnode&utm_medium=feed)

A. 评估 关键在于 \\(|a\_i| \\le 1000\\)，所以可以开一个长度为 2000 的数组统计一下每个值的个数，然后 \\(\\Theta(n^2)\\) 处理这个 2000 的数组。 #include <iostream> using namespace std; const int N = 2010; int a\[N\]; int main() { int n; scanf("%d", &n); for (int i = 1; i <= n; ++i) { ...

Jun 8, 2025 · 6 min read · invalidname.hashnode.dev  
Read the article

-   [#cpp](https://hashnode.com/tag/cpp)
-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#competitive-programming](https://hashnode.com/tag/competitive-programming)

## Written by

[Star](https://hashnode.com/@InvalidName)

@InvalidName · China

  
[View profile](https://hashnode.com/@InvalidName)

A Chinese OIer and a tosser.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
