Submission #1062974


Source Code Expand

Copy
#include<iostream>
#include<algorithm>
using namespace std;
main()
{
	int n,d[500],s[501];
	cin>>n;
	for(int i=0;i<n;i++)cin>>d[i];
	s[0]=0;
	for(int i=1;i<=n;i++)s[i]=s[i-1]+d[i-1];
	int m=15000000;
	for(int i=0;i<=n;i++)
	{
		for(int j=i;j<=n;j++)
		{
			int a[3]={s[n]-s[j],s[j]-s[i],s[i]};
			sort(a,a+3);
			m=min(m,a[2]-a[1]-a[0]);
		}
	}
	cout<<s[n]<<"\n"<<(m<0?0:m)<<endl;
}

Submission Info

Submission Time
Task B - 2点間距離の最大と最小 ( Maximum and Minimum )
User kotatsugame
Language C++ (G++ 4.6.4)
Score 100
Code Size 403 Byte
Status
Exec Time 20 ms
Memory 928 KB

Judge Result

Set Name Score / Max Score Test Cases
All 100 / 100 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 18 ms 800 KB
00_sample_02.txt 16 ms 676 KB
00_sample_03.txt 18 ms 676 KB
00_sample_04.txt 16 ms 804 KB
00_sample_05.txt 18 ms 676 KB
01_rnd_00.txt 18 ms 676 KB
01_rnd_01.txt 18 ms 800 KB
01_rnd_02.txt 18 ms 800 KB
01_rnd_03.txt 16 ms 804 KB
01_rnd_04.txt 16 ms 676 KB
01_rnd_05.txt 18 ms 800 KB
01_rnd_06.txt 18 ms 800 KB
01_rnd_07.txt 17 ms 800 KB
01_rnd_08.txt 17 ms 800 KB
01_rnd_09.txt 16 ms 672 KB
01_rnd_10.txt 18 ms 796 KB
01_rnd_11.txt 16 ms 804 KB
01_rnd_12.txt 18 ms 804 KB
01_rnd_13.txt 17 ms 920 KB
01_rnd_14.txt 18 ms 804 KB
01_rnd_15.txt 18 ms 676 KB
02_rnd2_00.txt 18 ms 800 KB
02_rnd2_01.txt 18 ms 676 KB
02_rnd2_02.txt 16 ms 804 KB
02_rnd2_03.txt 17 ms 928 KB
02_rnd2_04.txt 18 ms 928 KB
02_rnd2_05.txt 18 ms 800 KB
02_rnd2_06.txt 18 ms 804 KB
02_rnd2_07.txt 16 ms 800 KB
02_rnd2_08.txt 18 ms 804 KB
02_rnd2_09.txt 18 ms 800 KB
02_rnd2_10.txt 17 ms 796 KB
02_rnd2_11.txt 18 ms 800 KB
02_rnd2_12.txt 18 ms 796 KB
02_rnd2_13.txt 17 ms 928 KB
02_rnd2_14.txt 16 ms 804 KB
02_rnd2_15.txt 18 ms 804 KB
02_rnd2_16.txt 18 ms 796 KB
02_rnd2_17.txt 17 ms 676 KB
02_rnd2_18.txt 18 ms 804 KB
02_rnd2_19.txt 17 ms 676 KB
02_rnd2_20.txt 18 ms 804 KB
02_rnd2_21.txt 18 ms 800 KB
02_rnd2_22.txt 18 ms 800 KB
02_rnd2_23.txt 18 ms 924 KB
02_rnd2_24.txt 16 ms 676 KB
02_rnd2_25.txt 18 ms 928 KB
02_rnd2_26.txt 17 ms 676 KB
02_rnd2_27.txt 18 ms 672 KB
02_rnd2_28.txt 18 ms 800 KB
02_rnd2_29.txt 16 ms 800 KB
03_max_00.txt 20 ms 796 KB
03_max_01.txt 20 ms 800 KB
03_max_02.txt 18 ms 804 KB
03_max_03.txt 20 ms 800 KB
03_max_04.txt 20 ms 800 KB
03_max_05.txt 19 ms 796 KB
03_max_06.txt 20 ms 800 KB
03_max_07.txt 20 ms 672 KB
03_max_08.txt 19 ms 924 KB
03_max_09.txt 20 ms 796 KB
04_maxret_01.txt 20 ms 676 KB
04_maxret_02.txt 18 ms 676 KB