Cod sursa(job #960700)
Utilizator | Data | 10 iunie 2013 23:57:16 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main(){
int n,i,j,k,s,smax=-999999,v[600001],in,inf;
in>>n;
for(i=1;i<=n;i++) in>>v[i];
for(i=1;i<=n;i++)
for(j=i;j<=n;j++){
if(smax<s){
smax=s;
in=i;
inf=j;
}
s=0;
for(k=i;k<=j;k++)
s=s+v[k];
}
out<<smax<<" "<<in<<" "<<inf;
return 0;
}