Submission #1072763


Source Code Expand

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

const int MM = 1e9 + 7;
const double eps = 1e-8;
const int MAXN = 2e6 + 10;
const ll INF = 1ll << 60;

int n, m;

ll f[MAXN][2];

int a[MAXN];

void prework(){

}

int b[MAXN];

void read(){
	scanf("%d", &n);
	for(int i = 1; i <= n; i++){
		scanf("%d", &a[i]);
		char s[10];
		if (i < n){
			scanf("%s", s);
			if (s[0] == '+')
				b[i + 1] = 1;
			else
				b[i + 1] = -1;
		}
	}
	b[0] = b[1] = 1;
	f[0][0] = 0;
	f[0][2] = f[0][1] = -INF;
	for(int i = 1; i <= n; i++){
		if (b[i] == 1){
			f[i][1] = max(f[i-1][1] - a[i], f[i-1][2] + a[i]);
			f[i][2] = f[i-1][2] + a[i];
			f[i][0] = max(f[i-1][0] + a[i], f[i-1][1]);
		}
		else{
			f[i][2] = max(f[i-1][1] + a[i], f[i-1][2] - a[i]);
			f[i][0] = max(f[i-1][0] - a[i], f[i][2]);
			f[i][1] = f[i][0];
		}
		//cout<<f[i][0]<<' '<<f[i][1]<<endl;
	}
	cout<<max(f[n][1],max(f[n][0], f[n][2]))<<endl;
}

void solve(int casi){

}

void printans(){

}


int main(){
	prework();
	int T = 1;
//	cin>>T;
	for(int i = 1; i <= T; i++){
		read();
		solve(i);
		printans();
	}
	return 0;
}


Submission Info

Submission Time
Task E - Addition and Subtraction Hard
User vjudge1
Language C++14 (GCC 5.4.1)
Score 900
Code Size 1127 Byte
Status AC
Exec Time 24 ms
Memory 2560 KB

Compile Error

./Main.cpp: In function ‘void read()’:
./Main.cpp:26:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:28:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
                     ^
./Main.cpp:31:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%s", s);
                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 900 / 900
Status
AC × 3
AC × 26
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 AC 2 ms 256 KB
subtask_1_alladd_01.txt AC 24 ms 2560 KB
subtask_1_alladd_02.txt AC 24 ms 2560 KB
subtask_1_alladd_03.txt AC 23 ms 2560 KB
subtask_1_alladd_04.txt AC 23 ms 2560 KB
subtask_1_allsub_01.txt AC 24 ms 2560 KB
subtask_1_allsub_02.txt AC 24 ms 2560 KB
subtask_1_allsub_03.txt AC 24 ms 2560 KB
subtask_1_allsub_04.txt AC 24 ms 2560 KB
subtask_1_cont_01.txt AC 14 ms 1536 KB
subtask_1_cont_02.txt AC 11 ms 1152 KB
subtask_1_cont_03.txt AC 10 ms 1024 KB
subtask_1_cont_04.txt AC 4 ms 384 KB
subtask_1_killer_01.txt AC 22 ms 2432 KB
subtask_1_killer_02.txt AC 16 ms 1792 KB
subtask_1_killer_03.txt AC 22 ms 2560 KB
subtask_1_killer_04.txt AC 16 ms 1792 KB
subtask_1_max_01.txt AC 24 ms 2560 KB
subtask_1_max_02.txt AC 24 ms 2560 KB
subtask_1_max_03.txt AC 24 ms 2560 KB
subtask_1_max_04.txt AC 24 ms 2560 KB
subtask_1_min_01.txt AC 2 ms 256 KB
subtask_1_min_02.txt AC 2 ms 256 KB
subtask_1_rand_01.txt AC 15 ms 1664 KB
subtask_1_rand_02.txt AC 18 ms 1920 KB
subtask_1_rand_03.txt AC 4 ms 512 KB
subtask_1_rand_04.txt AC 9 ms 896 KB