Cod sursa(job #1817760)
| Utilizator | Data | 28 noiembrie 2016 13:55:49 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int S[100],n,i,j,s[100],k;
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=0;i<n;i++){
f>>S[i];
}
for(i=0;i<n;i++){
k=0;
for(j=0;j<i;j++){
k=k+S[j];
}
s[i]=k;
}
int smax=s[0],imax,jmax;
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(s[j]-s[i]>=smax){
smax=s[j]-s[i];
imax=i+1;
jmax=j;
}
}
}
g<<smax<<" "<<imax<<" "<<jmax;
g.close();
return 0;
}
