Cod sursa(job #1597592)
Utilizator | Data | 12 februarie 2016 09:36:34 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[6000000];
int main()
{
int n,i,j,max1=-32000,min1=32000,pzm,pzmin;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=2;i<=n;i++)
a[i]+=a[i-1];
for(i=1;i<=n;i++)
{
if(a[i]>max1)
{
max1=a[i];
pzm=i;
}
else
if(a[i]<min1)
{
min1=a[i];
pzmin=i;
}
}
max1-=min1;
g<<max1<<" "<<pzmin+1<<" "<<pzm;
return 0;
}