Cod sursa(job #1617866)
Utilizator | Data | 27 februarie 2016 16:52:39 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int main(){
int n,a[10000],i,j,sm=-9999,si,sj;
f>>n;
for(i=1;i<=n;i++){
f>>a[i];
if(i!=0)
a[i]=a[i]+a[i-1];
}
for(i=1;i<=n;i++){
for(j=i;j<=n;j++)
if(a[j]-a[i]>sm){
sm=a[j]-a[i];
si=i+1;
sj=j;
}
}
g<<sm<<' '<<si<<' '<<sj;
return 0;
}