Cod sursa(job #1332951)
| Utilizator | Data | 2 februarie 2015 16:42:25 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <cstring>
#define NMAX 6000001
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[NMAX],i,j,SUM,n,MAX,a,b;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
MAX=v[1];
a=1;
b=1;
for(i=1;i<=n;i++){
SUM=0;
for(j=i;j<=n;j++){
SUM+=v[j];
if(SUM>MAX){
MAX=SUM;
a=i;
b=j;
}
}
}
g<<MAX<<' '<<a<<' '<<b<<'\n';
return 0;
}
