Cod sursa(job #1015382)
Utilizator | Data | 24 octombrie 2013 15:16:58 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout("ssm.out");
int n, v[6000001], s, i, j, p, u, m;
int main(){
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
for(i=1; i<=n; i++){
s=0;
for(j=i; j<=n; j++){
s+=v[j];
if(s>m){
m=s;
p=i;
u=j;
}
}
}
fout<<m<<" "<<p<<" "<<u;
return 0;
}