Submission #1779231


Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
#define ALL(X) X.begin(), X.end()
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef std::pair<LL,LL> PLL;//
typedef std::pair<int,int> PII;//
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)4e18+20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	int N;
	cin >> N;
	vector<int> A(N);
	for(int i=0;i<N;++i){
		cin >> A[i];
	}
	int MIN = INF;
	int MAX = 0;
	for(int i=0;i<N/2;++i){
		int res = A[i]+A[N-1-i];
		MIN = min(MIN,res);
		MAX = max(MAX,res);
	}
	cout << MAX-MIN << endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()

Submission Info

Submission Time
Task A - Table Tennis
User akarin55
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1565 Byte
Status WA
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 8
WA × 19
Set Name Test Cases
All 00-sample-00.txt, 00-sample-01.txt, 10-unique-00.txt, 10-unique-01.txt, 10-unique-02.txt, 10-unique-03.txt, 10-unique-04.txt, 20-order-00.txt, 20-order-01.txt, 20-order-02.txt, 20-order-03.txt, 20-order-04.txt, 30-random-00.txt, 30-random-01.txt, 30-random-02.txt, 30-random-03.txt, 30-random-04.txt, 30-random-05.txt, 30-random-06.txt, 30-random-07.txt, 30-random-08.txt, 30-random-09.txt, 30-random-10.txt, 30-random-11.txt, 30-random-12.txt, 30-random-13.txt, 30-random-14.txt
Case Name Status Exec Time Memory
00-sample-00.txt AC 1 ms 256 KB
00-sample-01.txt AC 1 ms 256 KB
10-unique-00.txt AC 1 ms 256 KB
10-unique-01.txt AC 1 ms 256 KB
10-unique-02.txt AC 1 ms 256 KB
10-unique-03.txt AC 1 ms 256 KB
10-unique-04.txt AC 1 ms 256 KB
20-order-00.txt WA 1 ms 256 KB
20-order-01.txt WA 1 ms 256 KB
20-order-02.txt WA 1 ms 256 KB
20-order-03.txt WA 1 ms 256 KB
20-order-04.txt WA 1 ms 256 KB
30-random-00.txt AC 1 ms 256 KB
30-random-01.txt WA 1 ms 256 KB
30-random-02.txt WA 1 ms 256 KB
30-random-03.txt WA 1 ms 256 KB
30-random-04.txt WA 2 ms 256 KB
30-random-05.txt WA 1 ms 256 KB
30-random-06.txt WA 1 ms 256 KB
30-random-07.txt WA 1 ms 256 KB
30-random-08.txt WA 1 ms 256 KB
30-random-09.txt WA 1 ms 256 KB
30-random-10.txt WA 1 ms 256 KB
30-random-11.txt WA 1 ms 256 KB
30-random-12.txt WA 1 ms 256 KB
30-random-13.txt WA 1 ms 256 KB
30-random-14.txt WA 1 ms 256 KB