Cod sursa(job #516111)
| Utilizator | Data | 23 decembrie 2010 11:17:49 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream.h>
#include<iostream.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[6000001];
int main(){
int i,n,k,j,imax,jmax,max,s;
fin>>n;
max=INT_MIN;
for(i=1;i<=n;i++){
s=0;
for(j=i;j<=n;j++){
if(v[j])
fin>>v[j];
s+=v[j];
if(max<s){
imax=i;
jmax=j;
max=s;
}
}
}
fout<<max<<" "<<imax<<" "<<jmax;
return 0;
}
