Submission #2384502
Source Code Expand
#include<iostream> #include<cstdio> #include<cstdlib> #include<algorithm> #include<cstring> #include<string> #include<math.h> #include<vector> using namespace std; int main(){ int N; cin>>N; int A[N],B[N+1]; int MAX=0; cin>>A[0]; B[0]=A[0]; MAX+=abs(B[0]); for(int i=1;i<N;i++){ cin>>A[i]; B[i]=A[i]-A[i-1]; MAX+=abs(B[i]); } B[N]=-A[N-1]; MAX+=abs(B[N]); for(int i=0;i<N;i++){ if(B[i]*B[i+1]<0){ cout<<MAX-2*min(abs(B[i]),abs(B[i+1]))<<"\n"; } else cout<<MAX<<"\n"; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Traveling Plan |
User | charter |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 645 Byte |
Status | AC |
Exec Time | 46 ms |
Memory | 2048 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt, sample-03.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 43 ms | 2048 KB |
02.txt | AC | 46 ms | 2048 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 43 ms | 2048 KB |
05.txt | AC | 43 ms | 2048 KB |
06.txt | AC | 44 ms | 2048 KB |
07.txt | AC | 43 ms | 2048 KB |
08.txt | AC | 44 ms | 2048 KB |
09.txt | AC | 36 ms | 1664 KB |
10.txt | AC | 37 ms | 1664 KB |
11.txt | AC | 36 ms | 1664 KB |
12.txt | AC | 36 ms | 1664 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |