제출 #492600

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
492600		Biaz	Orchard (NOI14_orchard)	C++17	4 / 25	36 ms	620 KiB

orchard

#include <bits/stdc++.h>
//#define int long long
//#define double long double
#define Nanase_Kurumi_aka_menhera_chan_is_mine ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define pi pair<int, int>
#define ALL(i) i.begin(),i.end()
#define gcd(i,j) __gcd(i,j)
#define fi first
#define se second
#define eps 0.00000001
#define ist insert
#define DNE nullptr
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
//#pragma GCC optimize("O2")
int max(int x,int y){return x>=y?x:y;}
int min(int x,int y){return x>=y?y:x;}
using namespace std;
typedef int ll;
const int N=100005;
const int M=1000005;
const int MOD=1000000007;//998244353;
//const int INF=1000000000000000000;//2147483647;

int n,m,tot;
int a[N];
inline void sol(){
    cin >>n>>m;
    for (int i=0;i<n;i++)
        for (int j=1;j<=m;j++)
            cin >>a[j],a[j]+=a[j-1];
    tot=a[m];
    for (int i=1;i<=m;i++)
        a[i]=2*a[i]-i;
    int ans=0,mn=2147483647;
    for (int i=1;i<=m;i++){
        ans=max(ans,a[i]-mn);
        mn=min(mn,a[i]);
    }
    cout <<tot-ans<<'\n';
}
signed main(){
    Nanase_Kurumi_aka_menhera_chan_is_mine
    int _=1;
    //cin >>_;
    while (_--) sol();
    return 0;
}

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