Submission #23681


Source Code Expand

#include <iostream>
#include <vector>
using namespace std;

int main()
{
	int n;
	cin >> n;

	int maxlen, minlen, longest;
	maxlen = minlen = longest = 0;
	for( int i = 0; i < n; ++i ){
		int d;
		cin >> d;

		if( i == 0 ){
			maxlen = d;
			minlen = d;
		}else{
			maxlen += d;
			if( i == 1 ){
				if( minlen <= d ){
					longest = d;
				}else{
					longest = minlen;
					minlen = d;
				}
			}else{
				if( longest <= d ){
					minlen += longest;
					longest = d;
				}else{
					minlen += d;
				}
			}
		}
	}

	if( n == 2 ){
		minlen = longest - minlen >= 0 ? longest - minlen : minlen - longest;
	}else if( n >= 3 ){
		if( minlen <= longest ){
			minlen = longest - minlen;
		}else{
			minlen = 0;
		}
	}

	cout << maxlen << endl;
	cout << minlen << endl;

	return 0;
}

Submission Info

Submission Time
Task B - 2点間距離の最大と最小 ( Maximum and Minimum )
User battamon
Language C++ (GCC 4.4.7)
Score 100
Code Size 830 Byte
Status AC
Exec Time 43 ms
Memory 872 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 63
Set Name Test Cases
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 02_rnd2_00.txt, 02_rnd2_01.txt, 02_rnd2_02.txt, 02_rnd2_03.txt, 02_rnd2_04.txt, 02_rnd2_05.txt, 02_rnd2_06.txt, 02_rnd2_07.txt, 02_rnd2_08.txt, 02_rnd2_09.txt, 02_rnd2_10.txt, 02_rnd2_11.txt, 02_rnd2_12.txt, 02_rnd2_13.txt, 02_rnd2_14.txt, 02_rnd2_15.txt, 02_rnd2_16.txt, 02_rnd2_17.txt, 02_rnd2_18.txt, 02_rnd2_19.txt, 02_rnd2_20.txt, 02_rnd2_21.txt, 02_rnd2_22.txt, 02_rnd2_23.txt, 02_rnd2_24.txt, 02_rnd2_25.txt, 02_rnd2_26.txt, 02_rnd2_27.txt, 02_rnd2_28.txt, 02_rnd2_29.txt, 03_max_00.txt, 03_max_01.txt, 03_max_02.txt, 03_max_03.txt, 03_max_04.txt, 03_max_05.txt, 03_max_06.txt, 03_max_07.txt, 03_max_08.txt, 03_max_09.txt, 04_maxret_01.txt, 04_maxret_02.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 20 ms 732 KB
00_sample_02.txt AC 20 ms 780 KB
00_sample_03.txt AC 21 ms 788 KB
00_sample_04.txt AC 21 ms 768 KB
00_sample_05.txt AC 21 ms 784 KB
01_rnd_00.txt AC 21 ms 768 KB
01_rnd_01.txt AC 22 ms 776 KB
01_rnd_02.txt AC 21 ms 780 KB
01_rnd_03.txt AC 21 ms 788 KB
01_rnd_04.txt AC 21 ms 784 KB
01_rnd_05.txt AC 21 ms 788 KB
01_rnd_06.txt AC 21 ms 780 KB
01_rnd_07.txt AC 21 ms 784 KB
01_rnd_08.txt AC 23 ms 788 KB
01_rnd_09.txt AC 21 ms 788 KB
01_rnd_10.txt AC 21 ms 736 KB
01_rnd_11.txt AC 20 ms 764 KB
01_rnd_12.txt AC 21 ms 776 KB
01_rnd_13.txt AC 21 ms 788 KB
01_rnd_14.txt AC 23 ms 776 KB
01_rnd_15.txt AC 21 ms 780 KB
02_rnd2_00.txt AC 21 ms 784 KB
02_rnd2_01.txt AC 21 ms 780 KB
02_rnd2_02.txt AC 21 ms 724 KB
02_rnd2_03.txt AC 21 ms 780 KB
02_rnd2_04.txt AC 22 ms 772 KB
02_rnd2_05.txt AC 21 ms 780 KB
02_rnd2_06.txt AC 21 ms 784 KB
02_rnd2_07.txt AC 21 ms 784 KB
02_rnd2_08.txt AC 21 ms 784 KB
02_rnd2_09.txt AC 21 ms 784 KB
02_rnd2_10.txt AC 21 ms 780 KB
02_rnd2_11.txt AC 21 ms 784 KB
02_rnd2_12.txt AC 21 ms 736 KB
02_rnd2_13.txt AC 21 ms 776 KB
02_rnd2_14.txt AC 21 ms 768 KB
02_rnd2_15.txt AC 21 ms 784 KB
02_rnd2_16.txt AC 21 ms 776 KB
02_rnd2_17.txt AC 21 ms 780 KB
02_rnd2_18.txt AC 23 ms 848 KB
02_rnd2_19.txt AC 21 ms 780 KB
02_rnd2_20.txt AC 21 ms 780 KB
02_rnd2_21.txt AC 21 ms 776 KB
02_rnd2_22.txt AC 21 ms 736 KB
02_rnd2_23.txt AC 21 ms 780 KB
02_rnd2_24.txt AC 21 ms 776 KB
02_rnd2_25.txt AC 21 ms 780 KB
02_rnd2_26.txt AC 21 ms 732 KB
02_rnd2_27.txt AC 21 ms 784 KB
02_rnd2_28.txt AC 21 ms 868 KB
02_rnd2_29.txt AC 21 ms 784 KB
03_max_00.txt AC 23 ms 784 KB
03_max_01.txt AC 43 ms 768 KB
03_max_02.txt AC 23 ms 872 KB
03_max_03.txt AC 22 ms 784 KB
03_max_04.txt AC 21 ms 784 KB
03_max_05.txt AC 23 ms 860 KB
03_max_06.txt AC 21 ms 780 KB
03_max_07.txt AC 21 ms 764 KB
03_max_08.txt AC 21 ms 776 KB
03_max_09.txt AC 21 ms 784 KB
04_maxret_01.txt AC 21 ms 780 KB
04_maxret_02.txt AC 21 ms 784 KB