Cod sursa(job #2394403)
| Utilizator | Data | 1 aprilie 2019 16:47:45 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream f ( "ssm.in" );
ofstream g ( "ssm.out" );
int v[6000006];
int main()
{ long long n,vmin=INT_MAX,vmax=INT_MIN,ind1=1,ind2=0;
f>>n;
for(int i=1;i<=n;i++) f>>v[i];
for(long long i=1,suma=0;i<=n;i++)
{ suma+=v[i];
if(vmin>suma) vmin=suma,ind1=i+1;
if(vmax<suma-vmin) vmax=suma-vmin,ind2=i;
}
g<<vmax<< ' '<<ind1<< ' '<<ind2;
return 0;
}
