Submission #1072714


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <cstdlib>
#include <set>
#include <queue>
using namespace std;

#define X first
#define Y second
#define N 100010
typedef long long ll;
typedef pair<int,int> pii;
const int Mod=1000000007;

const double INF=1e18;

int n;
int a[N];
ll s[N],f[N];

int main()
{
	//freopen("in.in","r",stdin);
	//freopen("out.out","w",stdout);
	
	scanf("%d",&n);  scanf("%d",&a[1]); s[1]=a[1];
	for (int i=2;i<=n;i++)
	{
		char op; scanf(" %c",&op);
		scanf("%d",&a[i]);
		if (op=='-') a[i]=-a[i];
		s[i]=a[i]+s[i-1];
	}
	
	f[n]=a[n];
	ll mx=-s[n];
	for (int i=n-1;i>=1;i--)
	{
		if (a[i]<0) 
		{
			f[i]=a[i]+f[i+1];
			f[i]=max(f[i],a[i]+s[i]+mx);
		}
		else f[i]=a[i]+f[i+1];
		mx=max(mx,f[i+1]-s[i]);
		//cout<<i<<" "<<f[i]<<" "<<a[i]<<" "<<s[i]<<" "<<mx<<endl;
	}
	cout<<f[1]<<endl;
	return 0;

}

Submission Info

Submission Time
Task E - Addition and Subtraction Hard
User vjudge1
Language C++14 (GCC 5.4.1)
Score 0
Code Size 919 Byte
Status WA
Exec Time 21 ms
Memory 2176 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:31:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);  scanf("%d",&a[1]); s[1]=a[1];
                ^
./Main.cpp:31:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);  scanf("%d",&a[1]); s[1]=a[1];
                                    ^
./Main.cpp:34:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   char op; scanf(" %c",&op);
                            ^
./Main.cpp:35:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i]);
                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 900
Status
AC × 2
WA × 1
AC × 10
WA × 16
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All subtask_1_alladd_01.txt, subtask_1_alladd_02.txt, subtask_1_alladd_03.txt, subtask_1_alladd_04.txt, subtask_1_allsub_01.txt, subtask_1_allsub_02.txt, subtask_1_allsub_03.txt, subtask_1_allsub_04.txt, subtask_1_cont_01.txt, subtask_1_cont_02.txt, subtask_1_cont_03.txt, subtask_1_cont_04.txt, subtask_1_killer_01.txt, subtask_1_killer_02.txt, subtask_1_killer_03.txt, subtask_1_killer_04.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_max_03.txt, subtask_1_max_04.txt, subtask_1_min_01.txt, subtask_1_min_02.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_rand_03.txt, subtask_1_rand_04.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 256 KB
sample_02.txt AC 2 ms 256 KB
sample_03.txt WA 3 ms 256 KB
subtask_1_alladd_01.txt AC 21 ms 2176 KB
subtask_1_alladd_02.txt AC 20 ms 2176 KB
subtask_1_alladd_03.txt AC 21 ms 2176 KB
subtask_1_alladd_04.txt AC 21 ms 2176 KB
subtask_1_allsub_01.txt AC 21 ms 2176 KB
subtask_1_allsub_02.txt AC 21 ms 2176 KB
subtask_1_allsub_03.txt AC 21 ms 2176 KB
subtask_1_allsub_04.txt AC 21 ms 2176 KB
subtask_1_cont_01.txt WA 12 ms 1280 KB
subtask_1_cont_02.txt WA 10 ms 1024 KB
subtask_1_cont_03.txt WA 9 ms 896 KB
subtask_1_cont_04.txt WA 4 ms 384 KB
subtask_1_killer_01.txt WA 19 ms 2048 KB
subtask_1_killer_02.txt WA 14 ms 1536 KB
subtask_1_killer_03.txt WA 20 ms 2176 KB
subtask_1_killer_04.txt WA 14 ms 1536 KB
subtask_1_max_01.txt WA 21 ms 2176 KB
subtask_1_max_02.txt WA 21 ms 2176 KB
subtask_1_max_03.txt WA 21 ms 2176 KB
subtask_1_max_04.txt WA 21 ms 2176 KB
subtask_1_min_01.txt AC 3 ms 256 KB
subtask_1_min_02.txt AC 2 ms 256 KB
subtask_1_rand_01.txt WA 14 ms 1408 KB
subtask_1_rand_02.txt WA 16 ms 1664 KB
subtask_1_rand_03.txt WA 4 ms 384 KB
subtask_1_rand_04.txt WA 8 ms 896 KB