Cod sursa(job #1848893)
| Utilizator | Data | 16 ianuarie 2017 19:57:18 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[1000];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,stmin,drmin,drmax,stmax,s,smin,smax,i;
f >> n;
for(i=1;i<=n;i++){
f >> v[i];
}
smin=v[1];
smax=v[1];
s=v[1];
stmin=1;
drmin=1;
stmax=1;
drmax=1;
for(i=2;i<=n;i++){
s=s+v[i];
if(s<smin){
smin=s;
drmin=i;
}
if(s-smin>smax){
drmax=i;
smax=s-smin;
stmax=drmin+1;
}
}
g << smax<< " " << stmax << " "<<drmax;
}
