Submission #1072781
Source Code Expand
#include<stdio.h> #define N (100010) typedef long long LL; int a[N]; char b[N][2]; int n; int main(){ scanf("%d",&n); for (int i=1;i<n;i++){ scanf("%d%s",a+i,b[i]); } scanf("%d",a+n); LL ans1=a[1]; for (int i=1;i<n;i++) ans1+=b[i][0]=='+'?a[i+1]:-a[i+1]; LL temp=ans1; LL cur=a[n],tot=0; for (int i=n-1;i;i--){ if (b[i][0]=='-'){ temp=temp+a[i+1]; if (temp-cur+tot>ans1) ans1=temp-cur+tot; tot+=cur; cur=0; } else { temp=temp-a[i+1]; } cur+=a[i]; } printf("%lld\n",ans1); }
Submission Info
Submission Time | |
---|---|
Task | E - Addition and Subtraction Hard |
User | vjudge1 |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 512 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 768 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:8:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:10:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%s",a+i,b[i]); ^ ./Main.cpp:12:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",a+n); ^
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 | 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 | 128 KB |
sample_02.txt | AC | 1 ms | 128 KB |
sample_03.txt | AC | 1 ms | 128 KB |
subtask_1_alladd_01.txt | AC | 19 ms | 768 KB |
subtask_1_alladd_02.txt | AC | 19 ms | 768 KB |
subtask_1_alladd_03.txt | AC | 19 ms | 768 KB |
subtask_1_alladd_04.txt | AC | 19 ms | 768 KB |
subtask_1_allsub_01.txt | AC | 19 ms | 768 KB |
subtask_1_allsub_02.txt | AC | 19 ms | 768 KB |
subtask_1_allsub_03.txt | AC | 19 ms | 768 KB |
subtask_1_allsub_04.txt | AC | 19 ms | 768 KB |
subtask_1_cont_01.txt | AC | 11 ms | 512 KB |
subtask_1_cont_02.txt | AC | 8 ms | 384 KB |
subtask_1_cont_03.txt | AC | 7 ms | 384 KB |
subtask_1_cont_04.txt | AC | 3 ms | 256 KB |
subtask_1_killer_01.txt | AC | 17 ms | 768 KB |
subtask_1_killer_02.txt | AC | 13 ms | 512 KB |
subtask_1_killer_03.txt | AC | 18 ms | 768 KB |
subtask_1_killer_04.txt | AC | 13 ms | 512 KB |
subtask_1_max_01.txt | AC | 19 ms | 768 KB |
subtask_1_max_02.txt | AC | 19 ms | 768 KB |
subtask_1_max_03.txt | AC | 19 ms | 768 KB |
subtask_1_max_04.txt | AC | 19 ms | 768 KB |
subtask_1_min_01.txt | AC | 1 ms | 128 KB |
subtask_1_min_02.txt | AC | 1 ms | 128 KB |
subtask_1_rand_01.txt | AC | 12 ms | 512 KB |
subtask_1_rand_02.txt | AC | 14 ms | 640 KB |
subtask_1_rand_03.txt | AC | 3 ms | 256 KB |
subtask_1_rand_04.txt | AC | 7 ms | 384 KB |