| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 142741 | 冼俊烨 | 密钥 | C++ | Accepted | 100 | 71 MS | 952 KB | 320 | 2024-04-09 13:38:07 |
#include<bits/stdc++.h> #define int long long using namespace std; int n,m; int a[900005]; signed main() { cin>>n>>m; for(int i=1;i<=n;i++) { cin>>a[i]; } for(int i = 1;i<=n-m+1;i++) { int byd=-1e9; for(int j=1;j<=m;j++) { byd=max(byd,a[i+j-1]); } cout<<byd; } return 0; }//H