Cod sursa(job #2324002)
| Utilizator | Data | 20 ianuarie 2019 10:07:06 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("secv2.in");
ofstream fout ("secv2.out");
int n,i,j,s[6000005],a,b,maxsum=-99999,minsum,k;
bool test;
int main()
{
fin >> n>>k;
if (i==k) test = true;
for (i=1;i<=n;i++)
{
fin >>s[i];
s[i]+=s[i-1];
if (maxsum<s[i]-minsum&&(i>k||test==true))
{
maxsum=s[i]-minsum;a=j+1;b=i;
}
if (minsum>s[i])
{
minsum=s[i];j=i;
}
}
fout<< a<<" "<<b<<" "<<maxsum;
return 0;
}
