| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 121134 | A班卞定熙 | 幽灵粒子 | C++ | Wrong Answer | 0 | 0 MS | 248 KB | 322 | 2024-01-21 15:27:12 |
#include<bits/stdc++.h> using namespace std; int main(){ int n,l,Max=0,Min=0; scanf("%d%d",&n,&l); for(int i=1,temp;i<=n;i++){ scanf("%d",&temp); Max=max(Max,max(l-temp+1,temp)); Min=max(Min,min(l-temp+1,temp)); } cout << Max << " " << Min; return 0; }