Compilare: user.cpp:1:18: warning: extra tokens at end of #include directive [enabled by default] #include<fstream>#include<algorithm>using namespace std; ^ user.cpp:1:26: warning: invalid suffix on literal; C++11 requires a space between literal and identifier [-Wliteral-suffix] #include<fstream>#include<algorithm>using namespace std; ^ user.cpp: In function ‘int main()’: user.cpp:2:70: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] int v[50001];int main(){int n,k,i,p,u=1;freopen("secv2.in","r",stdin);freopen("secv2.out","w",stdout);scanf("%d%d",&n,&k);for(i=1;i<=n;++i){scanf("%d",&v[i]);v[i]+=v[i-1];}for(i=k;i<=n;++i)if(v[i]>v[u])u=i;for(i=u-k,p=u-k;i>=1;--i)if(v[i]<v[p])p=i;printf("%d %d %d\n",p+1,u,v[u]-v[p]);return 0;} ^ user.cpp:2:102: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] int v[50001];int main(){int n,k,i,p,u=1;freopen("secv2.in","r",stdin);freopen("secv2.out","w",stdout);scanf("%d%d",&n,&k);for(i=1;i<=n;++i){scanf("%d",&v[i]);v[i]+=v[i-1];}for(i=k;i<=n;++i)if(v[i]>v[u])u=i;for(i=u-k,p=u-k;i>=1;--i)if(v[i]<v[p])p=i;printf("%d %d %d\n",p+1,u,v[u]-v[p]);return 0;} ^ user.cpp:2:122: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int v[50001];int main(){int n,k,i,p,u=1;freopen("secv2.in","r",stdin);freopen("secv2.out","w",stdout);scanf("%d%d",&n,&k);for(i=1;i<=n;++i){scanf("%d",&v[i]);v[i]+=v[i-1];}for(i=k;i<=n;++i)if(v[i]>v[u])u=i;for(i=u-k,p=u-k;i>=1;--i)if(v[i]<v[p])p=i;printf("%d %d %d\n",p+1,u,v[u]-v[p]);return 0;} ^ user.cpp:2:158: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int v[50001];int main(){int n,k,i,p,u=1;freopen("secv2.in","r",stdin);freopen("secv2.out","w",stdout);scanf("%d%d",&n,&k);for(i=1;i<=n;++i){scanf("%d",&v[i]);v[i]+=v[i-1];}for(i=k;i<=n;++i)if(v[i]>v[u])u=i;for(i=u-k,p=u-k;i>=1;--i)if(v[i]<v[p])p=i;printf("%d %d %d\n",p+1,u,v[u]-v[p]);return 0;} ^