Cod sursa(job #949827)
| Utilizator | Data | 14 mai 2013 23:54:01 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream f("perle2.in");
ofstream g("perle2.out");
int n,k,aux[100005],ax,cont,mn,mx;
int main()
{bool ok = false;
mn=int(2e9);
mx=-int(2e9);
int ai,aj;
f>>n/*>>k*/>>aux[0];
aux[0]-=k;
for(int i=1;i<=n;i++)
{
f>>aux[i];
aux[i]-=k;
aux[i]+=aux[i-1];
if(aux[i]<mn) mn=aux[i], ai=i+1;
if(aux[i]-mn>mx) mx=aux[i]-mn, aj=i;
}
g<<mx<<' '<<ai+1<<' '<<aj+1;
/*for(int i=ai;i<=aj;i++)
g<<' '<<aux[i]-aux[i-1];*/
g.close();
f.close();
return 0;
}
