Cod sursa(job #1010021)
| Utilizator | Data | 14 octombrie 2013 09:51:19 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#define nmax 6000000
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g ("ssm.out");
int i,n,inceputbun,numarbun,v[nmax],prev,k=0,inceput=1,max1;
int main()
{f>>n;
for(i=1;i<=n;i++)
f>>v[i];
prev=v[1];
for(i=1;i<=n;i++){
if(v[i]+prev>=v[i]){
k++;
prev=v[i]+prev;
}
else {
inceput=i;
prev=v[i];
k=1;
}
if(max1<prev){
max1=prev;
inceputbun=inceput;
numarbun=k;
}
}
g<<max1<<" "<<inceputbun<<" "<<inceputbun+numarbun<<" ";
return 0;
}
