Submission #1794139
Source Code Expand
#include<iostream> #include<algorithm> using namespace std; int a,b,c,x[3000],ans=-1000000000,mx=-1000000000; int main() { cin>>a>>b>>c; for (int i=0;i<a;i++) cin>>x[i]; if (a==1){ cout<<max(abs(b-c),max(abs(b-x[0]),abs(c-x[0]))); return 0; } for (int i=0;i<a;i++) for (int j=i;j<a;j++){ if (x[j]<=x[i]) ans=max(ans,abs(x[i]-x[j])); if (mx<x[i]) mx=x[i]; } cout<<max(ans,abs(c-mx)); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - ABS |
User | sunsy |
Language | C++ (GCC 5.4.1) |
Score | 0 |
Code Size | 437 Byte |
Status | WA |
Exec Time | 9 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 500 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example_0, example_1, example_2, example_3 |
All | example_0, example_1, example_2, example_3, one_0, one_1, one_2, one_3, one_4, one_5, one_6, one_7, rand_0, rand_1, rand_10, rand_11, rand_12, rand_13, rand_14, rand_15, rand_2, rand_3, rand_4, rand_5, rand_6, rand_7, rand_8, rand_9 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example_0 | AC | 1 ms | 256 KB |
example_1 | AC | 1 ms | 256 KB |
example_2 | AC | 1 ms | 256 KB |
example_3 | AC | 1 ms | 256 KB |
one_0 | AC | 1 ms | 256 KB |
one_1 | AC | 1 ms | 256 KB |
one_2 | AC | 1 ms | 256 KB |
one_3 | WA | 1 ms | 256 KB |
one_4 | AC | 1 ms | 256 KB |
one_5 | WA | 1 ms | 256 KB |
one_6 | AC | 1 ms | 256 KB |
one_7 | WA | 1 ms | 256 KB |
rand_0 | WA | 9 ms | 256 KB |
rand_1 | WA | 2 ms | 256 KB |
rand_10 | WA | 9 ms | 256 KB |
rand_11 | WA | 3 ms | 256 KB |
rand_12 | WA | 9 ms | 256 KB |
rand_13 | WA | 7 ms | 256 KB |
rand_14 | WA | 9 ms | 256 KB |
rand_15 | WA | 1 ms | 256 KB |
rand_2 | WA | 9 ms | 256 KB |
rand_3 | WA | 7 ms | 256 KB |
rand_4 | WA | 9 ms | 256 KB |
rand_5 | WA | 4 ms | 256 KB |
rand_6 | WA | 9 ms | 256 KB |
rand_7 | WA | 4 ms | 256 KB |
rand_8 | WA | 9 ms | 256 KB |
rand_9 | WA | 7 ms | 256 KB |