Cod sursa(job #2442552)
Utilizator | Data | 24 iulie 2019 13:08:08 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,minim=10000001,maxim,a,b;
int v[1001];
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{
in>>v[i];
v[i]+=v[i-1];
if(v[i]<minim)
{
minim=v[i];
a=i+1;
}
if(v[i]-minim>maxim)
{
maxim=v[i]-minim;
b=i;
}
}
out<<a<<" "<<v[b]-v[a-1]<<" "<<b;
return 0;
}