Submission #10496092
Source Code Expand
#include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
const int N=100000;
const db pi=acos(-1.0);
#define lowbit(x) (x)&(-x)
#define sqr(x) (x)*(x)
#define rep(i,a,b) for (register int i=a;i<=b;i++)
#define per(i,a,b) for (register int i=a;i>=b;i--)
#define go(u,i) for (register int i=head[u];i;i=sq[i].nxt)
#define fir first
#define sec second
#define mp make_pair
#define pb push_back
#define maxd 998244353
#define eps 1e-8
inline int read()
{
int x=0,f=1;char ch=getchar();
while ((ch<'0') || (ch>'9')) {if (ch=='-') f=-1;ch=getchar();}
while ((ch>='0') && (ch<='9')) {x=x*10+(ch-'0');ch=getchar();}
return x*f;
}
namespace My_Math{
#define N 100000
int fac[N+100],invfac[N+100];
int add(int x,int y) {return x+y>=maxd?x+y-maxd:x+y;}
int dec(int x,int y) {return x<y?x-y+maxd:x-y;}
int mul(int x,int y) {return 1ll*x*y%maxd;}
ll qpow(ll x,int y)
{
ll ans=1;
while (y)
{
if (y&1) ans=mul(ans,x);
x=mul(x,x);y>>=1;
}
return ans;
}
int inv(int x) {return qpow(x,maxd-2);}
int C(int n,int m)
{
if ((n<m) || (n<0) || (m<0)) return 0;
return mul(mul(fac[n],invfac[m]),invfac[n-m]);
}
int math_init()
{
fac[0]=invfac[0]=1;
rep(i,1,N) fac[i]=mul(fac[i-1],i);
invfac[N]=inv(fac[N]);
per(i,N-1,1) invfac[i]=mul(invfac[i+1],i+1);
}
#undef N
}
using namespace My_Math;
int n;
ll f[100100][3];
int main()
{
n=read();
f[0][1]=f[0][2]=-1e18;
rep(i,1,n)
{
int x=read();
f[i][0]=max(f[i-1][0],f[i-1][1]);
f[i][1]=max(f[i-1][1],f[i-1][2]);
f[i][2]=f[i-1][2];
f[i][0]+=x;f[i][1]-=x;f[i][2]+=x;
if (x<0)
{
f[i][2]=max(f[i][2],f[i][1]);
f[i][1]=max(f[i][1],f[i][0]);
}
}
ll ans=max(max(f[n][0],f[n][1]),f[n][2]);
printf("%lld",ans);
return 0;
}
Submission Info
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 |
11 ms |
2560 KB |
subtask_1_alladd_02.txt |
AC |
11 ms |
2560 KB |
subtask_1_alladd_03.txt |
AC |
11 ms |
2560 KB |
subtask_1_alladd_04.txt |
AC |
11 ms |
2560 KB |
subtask_1_allsub_01.txt |
AC |
12 ms |
2560 KB |
subtask_1_allsub_02.txt |
AC |
11 ms |
2560 KB |
subtask_1_allsub_03.txt |
AC |
11 ms |
2560 KB |
subtask_1_allsub_04.txt |
AC |
12 ms |
2560 KB |
subtask_1_cont_01.txt |
AC |
6 ms |
1536 KB |
subtask_1_cont_02.txt |
AC |
5 ms |
1152 KB |
subtask_1_cont_03.txt |
AC |
5 ms |
1024 KB |
subtask_1_cont_04.txt |
AC |
2 ms |
384 KB |
subtask_1_killer_01.txt |
AC |
10 ms |
2432 KB |
subtask_1_killer_02.txt |
AC |
7 ms |
1792 KB |
subtask_1_killer_03.txt |
AC |
10 ms |
2560 KB |
subtask_1_killer_04.txt |
AC |
7 ms |
1792 KB |
subtask_1_max_01.txt |
AC |
11 ms |
2560 KB |
subtask_1_max_02.txt |
AC |
11 ms |
2560 KB |
subtask_1_max_03.txt |
AC |
11 ms |
2560 KB |
subtask_1_max_04.txt |
AC |
12 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 |
8 ms |
1664 KB |
subtask_1_rand_02.txt |
AC |
9 ms |
1920 KB |
subtask_1_rand_03.txt |
AC |
2 ms |
512 KB |
subtask_1_rand_04.txt |
AC |
4 ms |
896 KB |