Cod sursa(job #947387)
| Utilizator | Data | 7 mai 2013 11:54:44 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n,bestsum=INT_MIN,sum=INT_MIN,s,pi,pf,aux;
f>>n;
for(int i=1;i<=n;i++){
f>>s;
if(sum<0) sum=s,aux=i;
else sum+=s;
if(sum>bestsum){
bestsum=sum;
pi=aux;
pf=i;
}
}
g<<bestsum<<' '<<pi<<' '<<pf;
f.close();
g.close();
return 0;
}
