제출 #1329529

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1329529		Muhammad_Aneeq	과수원 (NOI14_orchard)	C++20	25 / 25	92 ms	8180 KiB

orchard

#include <bits/stdc++.h>
using namespace std;
inline void solve()
{
    int n,m;
    cin>>n>>m;
    int a[n][m];
    int sm=0;
    for (int i=0;i<n;i++)
        for (int j=0;j<m;j++)
        {
            char x;
            cin>>x;
            a[i][j]=x-'0';
            // cin>>a[i][j];
            sm+=a[i][j];
            if (a[i][j]==0)
                a[i][j]=-1;
        }
    int sms[m]={};
    int ans=sm-1;
    for (int i=0;i<n;i++)
    {
        for (int j=0;j<m;j++)
            sms[j]=0;
        for  (int j=i;j<n;j++)
        {
            for (int k=0;k<m;k++)
                sms[k]+=a[j][k];
            int cur=0,mx=0;
            for (int k=0;k<m;k++)
            {
                cur+=sms[k];
                mx=max(mx,cur);
                if (cur<0)
                    cur=0;
            }
            ans=min(ans,sm-mx);
        }
    }
    cout<<ans<<endl;
}
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int t=1;
    for (int i=1;i<=t;i++)
    {
        solve();
    }
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 5 / 5
• Subtask 4: 3 / 3
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5