Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
180485 | Wilbur | 密钥 | C++ | Accepted | 100 | 95 MS | 604 KB | 401 | 2024-08-21 14:26:44 |
#include <iostream> #include <algorithm> using namespace std; int main() { int n,n1; cin>>n>>n1; int a[109900]; for (int i = 0; i < n; i++){ cin>>a[i]; } int max; for (int i = 0; i < n-n1+1; i++){ max=-100000; for (int j = i; j < i+n1; j++){ if(max<a[j]) max=a[j]; } cout<<max; } }