Submission #1692725
Source Code Expand
#include<bits/stdc++.h>
#define N 100005
#define LL long long
#define INF (1LL<<60)
using namespace std;
int n,m; LL a[N],b[N],sum,ans=-INF;
int main()
{
int i,x; char op;
scanf("%d",&n);
for(i=1;i<=n;i++){
if(i==1) op='+'; else scanf("%c",&op);
scanf("%d ",&x),sum+=x;
if(op=='-') a[++m]=x; else b[m]+=x;
}
if(!m) ans=sum;
for(i=1;i<=m;i++){
ans=max(ans,sum-2*(a[i]+b[i]));
sum-=2*a[i];
}
cout<<max(ans,sum);
return 0;
}
Submission Info
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:10:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:12:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
if(i==1) op='+'; else scanf("%c",&op);
^
./Main.cpp:13:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d ",&x),sum+=x;
^
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 |
17 ms |
256 KB |
subtask_1_alladd_02.txt |
AC |
17 ms |
256 KB |
subtask_1_alladd_03.txt |
AC |
17 ms |
256 KB |
subtask_1_alladd_04.txt |
AC |
17 ms |
256 KB |
subtask_1_allsub_01.txt |
AC |
18 ms |
1024 KB |
subtask_1_allsub_02.txt |
AC |
18 ms |
1024 KB |
subtask_1_allsub_03.txt |
AC |
18 ms |
1024 KB |
subtask_1_allsub_04.txt |
AC |
18 ms |
1024 KB |
subtask_1_cont_01.txt |
AC |
10 ms |
640 KB |
subtask_1_cont_02.txt |
AC |
8 ms |
512 KB |
subtask_1_cont_03.txt |
AC |
7 ms |
512 KB |
subtask_1_cont_04.txt |
AC |
3 ms |
256 KB |
subtask_1_killer_01.txt |
AC |
16 ms |
256 KB |
subtask_1_killer_02.txt |
AC |
12 ms |
256 KB |
subtask_1_killer_03.txt |
AC |
17 ms |
256 KB |
subtask_1_killer_04.txt |
AC |
12 ms |
256 KB |
subtask_1_max_01.txt |
AC |
18 ms |
1024 KB |
subtask_1_max_02.txt |
AC |
18 ms |
1024 KB |
subtask_1_max_03.txt |
AC |
18 ms |
1152 KB |
subtask_1_max_04.txt |
AC |
18 ms |
1024 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 |
11 ms |
768 KB |
subtask_1_rand_02.txt |
AC |
13 ms |
768 KB |
subtask_1_rand_03.txt |
AC |
3 ms |
384 KB |
subtask_1_rand_04.txt |
AC |
6 ms |
512 KB |