Cod sursa(job #2394432)
| Utilizator | Data | 1 aprilie 2019 16:58:39 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,v[6000001],a[6000001];
long long sum=0,mi=300000000,ma=-300000000,u,p;
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{in>>v[i];a[i]=a[i-1]+v[i];}
for(int i=1;i<=n;i++)
{
if(a[i]>ma){ma=a[i];u=i;}
if(a[i]<mi){mi=a[i];p=i;}
}
sum=ma-mi;
/*for(int i=1;i<=n;i++)
out<<a[i]<<' ';*/
out<<sum<<' '<<p+1<<' '<<u;
return 0;
}
