Submission #1533989
Source Code Expand
#include<bits/stdc++.h> using namespace std; int n; long long a[100005],s[100005],cc[100005],ans; int main() { cin>>n>>a[1];s[1]=cc[1]=a[1]; for(int i=2;i<=n;i++) { char c; cin>>c>>a[i]; cc[i]=cc[i-1]+a[i]; if(c=='-')a[i]*=-1; s[i]=s[i-1]+a[i]; } ans=s[n]; for(int i=2;i<=n;i++)if(a[i]<0) { long long tt=a[i]*2; for(int j=i+1;j<=n&&a[j]>0;j++)tt-=a[j]*2; ans=max(ans,s[i-1]+tt+cc[n]-cc[i-1]); } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Addition and Subtraction Hard |
User | xuyuan |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 473 Byte |
Status | AC |
Exec Time | 50 ms |
Memory | 2560 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 900 / 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_alladd_01.txt | AC | 49 ms | 2560 KB |
subtask_1_alladd_02.txt | AC | 48 ms | 2560 KB |
subtask_1_alladd_03.txt | AC | 48 ms | 2560 KB |
subtask_1_alladd_04.txt | AC | 49 ms | 2560 KB |
subtask_1_allsub_01.txt | AC | 49 ms | 2560 KB |
subtask_1_allsub_02.txt | AC | 49 ms | 2560 KB |
subtask_1_allsub_03.txt | AC | 49 ms | 2560 KB |
subtask_1_allsub_04.txt | AC | 49 ms | 2560 KB |
subtask_1_cont_01.txt | AC | 27 ms | 1536 KB |
subtask_1_cont_02.txt | AC | 20 ms | 1152 KB |
subtask_1_cont_03.txt | AC | 17 ms | 1024 KB |
subtask_1_cont_04.txt | AC | 5 ms | 384 KB |
subtask_1_killer_01.txt | AC | 45 ms | 2432 KB |
subtask_1_killer_02.txt | AC | 33 ms | 1792 KB |
subtask_1_killer_03.txt | AC | 47 ms | 2560 KB |
subtask_1_killer_04.txt | AC | 32 ms | 1792 KB |
subtask_1_max_01.txt | AC | 49 ms | 2560 KB |
subtask_1_max_02.txt | AC | 50 ms | 2560 KB |
subtask_1_max_03.txt | AC | 49 ms | 2560 KB |
subtask_1_max_04.txt | AC | 49 ms | 2560 KB |
subtask_1_min_01.txt | AC | 1 ms | 256 KB |
subtask_1_min_02.txt | AC | 1 ms | 256 KB |
subtask_1_rand_01.txt | AC | 30 ms | 1664 KB |
subtask_1_rand_02.txt | AC | 36 ms | 1920 KB |
subtask_1_rand_03.txt | AC | 5 ms | 512 KB |
subtask_1_rand_04.txt | AC | 16 ms | 896 KB |