Submission #1217710
Source Code Expand
#include <cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <string> #include <iostream> #include <stdlib.h> using namespace std; int main() { int i,j,n; cin >> n; char op[100001]={}; long long int num[100001]={}; op[0] = '+'; cin >> num[0]; for(i=1;i<n;i++){ cin >> op[i] >> num[i]; } long long int dp[3]; dp[0] = num[0]; dp[1] = dp[2] = - (1 << 16); for(i=1;i<n;i++){ if(op[i] == '+'){ dp[0] = max(dp[0],dp[1]) + num[i]; dp[1] = max(dp[1],dp[2]) - num[i]; dp[2] += num[i]; } else{ dp[2] = max(dp[1],dp[2]) + num[i]; dp[1] = max(dp[1],dp[0]) - num[i]; dp[0] -= num[i]; } } long long int ans = max(dp[0],dp[1]); ans = max(ans,dp[2]); cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Addition and Subtraction Hard |
User | tsunenarazu |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 828 Byte |
Status | WA |
Exec Time | 54 ms |
Memory | 1152 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 900 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, 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 | 1152 KB |
sample_02.txt | AC | 2 ms | 1152 KB |
sample_03.txt | AC | 2 ms | 1152 KB |
subtask_1_alladd_01.txt | AC | 48 ms | 1152 KB |
subtask_1_alladd_02.txt | AC | 51 ms | 1152 KB |
subtask_1_alladd_03.txt | AC | 48 ms | 1152 KB |
subtask_1_alladd_04.txt | AC | 48 ms | 1152 KB |
subtask_1_allsub_01.txt | WA | 48 ms | 1152 KB |
subtask_1_allsub_02.txt | WA | 48 ms | 1152 KB |
subtask_1_allsub_03.txt | WA | 48 ms | 1152 KB |
subtask_1_allsub_04.txt | AC | 54 ms | 1152 KB |
subtask_1_cont_01.txt | WA | 27 ms | 1152 KB |
subtask_1_cont_02.txt | AC | 21 ms | 1152 KB |
subtask_1_cont_03.txt | WA | 18 ms | 1152 KB |
subtask_1_cont_04.txt | WA | 5 ms | 1152 KB |
subtask_1_killer_01.txt | WA | 45 ms | 1152 KB |
subtask_1_killer_02.txt | WA | 32 ms | 1152 KB |
subtask_1_killer_03.txt | WA | 46 ms | 1152 KB |
subtask_1_killer_04.txt | WA | 32 ms | 1152 KB |
subtask_1_max_01.txt | WA | 54 ms | 1152 KB |
subtask_1_max_02.txt | WA | 48 ms | 1152 KB |
subtask_1_max_03.txt | WA | 48 ms | 1152 KB |
subtask_1_max_04.txt | WA | 48 ms | 1152 KB |
subtask_1_min_01.txt | AC | 2 ms | 1152 KB |
subtask_1_min_02.txt | AC | 2 ms | 1152 KB |
subtask_1_rand_01.txt | WA | 30 ms | 1152 KB |
subtask_1_rand_02.txt | WA | 35 ms | 1152 KB |
subtask_1_rand_03.txt | AC | 6 ms | 1152 KB |
subtask_1_rand_04.txt | WA | 15 ms | 1152 KB |