Cod sursa(job #1011849)
| Utilizator | Data | 17 octombrie 2013 17:04:52 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, v[6000001], i, j, L, p, u, s, maxim, k;
int main() {
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
for(L=1; L<=n; L++){
for(i=1; i<=n-L+1; i++){
j=i+L-1;
s=0;
for(k=i; k<=j; k++)
s+=v[k];
if(s>maxim){
maxim=s;
p=i;
u=j;
}
}
}
fout<<maxim<<" "<<p<<" "<<u<<"\n";
return 0;
}
