Pagini recente » Cod sursa (job #2398163) | Cod sursa (job #2695237) | Cod sursa (job #1639811) | Cod sursa (job #2941933) | Cod sursa (job #2618967)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
struct Subsecventa{
int lungime;
int capatStanga;
int capatDreapta;
int sumaMaxima;
};
Subsecventa date[100005];
int numarElemente=0;
int nr_elem, elemente[100005], stanga, dreapta, sumMax=-1, minim=9999999;
int main()
{
fin>>nr_elem;
for(int i=1;i<=nr_elem;i++)
fin>>elemente[i];
for(int i=1;i<nr_elem;i++)
{
int suma=elemente[i];
for(int j=i+1;j<=nr_elem;j++)
{
suma=suma+elemente[j];
if(suma>sumMax)
{
sumMax=suma;
int lungime=j-i+1;
date[++numarElemente].lungime=lungime;
date[numarElemente].capatStanga=i;
date[numarElemente].capatDreapta=j;
date[numarElemente].sumaMaxima=sumMax;
}
}
}
int lungimeMaxima=-1, indiceMinim=9999999;
for(int i=1;i<=numarElemente;i++)
{
if(date[i].sumaMaxima==sumMax)
{
if(date[i].lungime>lungimeMaxima)
lungimeMaxima=date[i].lungime;
if(date[i].lungime==lungimeMaxima)
{
if(date[i].capatStanga<indiceMinim)
indiceMinim=date[i].capatStanga;
if(date[i].capatStanga==indiceMinim)
{
fout<<date[i].sumaMaxima<<" "<<date[i].capatStanga<<" "<<date[i].capatDreapta;
}
}
}
}
return 0;
}