Cod sursa(job #1691491)
Utilizator | Data | 18 aprilie 2016 15:49:55 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
long long mn=10000000000,mx=-100000000,s=0;
int n,ap1=1,ap2=1;
in>>n;
int a;
for(int i=1;i<=n;i++)
{
in>>a;
s+=a;
if(mn>s)
{
ap1=i+1;
mn=s;
}
if(mx<=s)
{
ap2=i;
mx=s;
}
}
out<<mx-mn<<" "<<ap1<<" "<<ap2;
return 0;
}