Cod sursa(job #1059069)
Utilizator | Data | 16 decembrie 2013 04:11:20 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,n,x,j=0,m=-6000001,m2=6000000,k;
f>>n;int_least32_t s=0;
for(i=1;i<=n;i++)
{
f>>x;
if(s<m2) {m2=s;k=i;}
s+=x;
if(s>m) {m=s;j=i;}
}
if(k>j) g<<m<<" "<<j<<" "<<j;
else g<<m-m2<<" "<<k<<" "<<j;
f.close();g.close();
return 0;
}