Cod sursa(job #1732805)
Utilizator | Data | 22 iulie 2016 16:27:28 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
long long mn = 100000000, mx = -1000000000;
int n, a , pozmn = 1 , pozmx = 1;
in >> n;
long long sum = 0;
for( int i = 1; i <= n; i ++ )
{
in >> a;
sum += a;
if(mn > sum)
{
mn = sum;
pozmn = i + 1;
}
if(mx < sum)
{
mx = sum;
pozmx = i;
}
}
out << mx-mn << " " << min(pozmn,pozmx) << " " << max(pozmx,pozmn);
return 0;
}